preprints.org > computer science and mathematics > computational mathematics > doi: 10.20944/preprints202410.0922.v1 (registering DOI)

Preprint Article Version 1 This version is not peer-reviewed

Version 1 : Received: 11 October 2024 / Approved: 11 October 2024 / Online: 11 October 2024 (12:07:12 CEST)

In this paper, we present a comparative analysis of seventeen different approaches to optimizing Euclidean distance computations, a core mathematical operation that plays a critical role in a wide range of algorithms, particularly in machine learning and data analysis. The Euclidean distance, being a computational bottleneck in large-scale optimization problems, requires efficient computation techniques to improve the performance of various distance-dependent algorithms. To address this, several optimization strategies can be employed to accelerate distance computations. From spatial data structures and approximate nearest neighbor algorithms to dimensionality reduction, vectorization, and parallel computing, various approaches exist to accelerate Euclidean distance computation in different contexts. Such approaches are particularly important for speeding up key machine learning algorithms like K-means and K-nearest neighbors (KNN). By understanding the trade-offs and assessing the effectiveness, complexity, and scalability of various optimization techniques, our findings help practitioners choose the most appropriate methods for improving Euclidean distance computations in specific contexts. These optimizations enable scalable and efficient processing for modern data-driven tasks, directly leading to reduced energy consumption and a minimized environmental impact.

Euclidean distance; optimization strategies; K-means clustering; K-nearest neighbors (KNN); vectorization; parallelization; triangle inequality; spatial data structures; block vector approximations; approximate methods

Computer Science and Mathematics, Computational Mathematics

* All users must log in before leaving a comment