EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Optimizing the Mean Shift Algorithm for Efficient Clustering

Rustam Mussabayev, Alexander Krassovitskiy, Meruyert Aristombayeva

Mathematics · 26.10.2025 · 13 (21) · 3408

DOI: 10.3390/math13213408 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Mathematics, online erschienen am 26.10.2025. Verfasst von Rustam Mussabayev und 2 weiteren Autor:innen. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 55 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Ministry of Science and Higher Education of the Republic of Kazakhstan.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Mean Shift is a flexible, non-parametric clustering algorithm that identifies dense regions in data through gradient ascent on a kernel density estimate. Its ability to detect arbitrarily shaped clusters without requiring prior knowledge of the number of clusters makes it widely applicable across diverse domains. However, its quadratic computational complexity restricts its use on large or high-dimensional datasets. Numerous acceleration techniques, collectively referred to as Fast Mean Shift strategies, have been developed to address this limitation while preserving clustering quality. This paper presents a systematic theoretical analysis of these strategies, focusing on their computational impact, pairwise combinability, and mapping onto distinct stages of the Mean Shift pipeline. Acceleration methods are categorized into seed reduction, neighborhood search acceleration, adaptive bandwidth selection, kernel approximation, and parallelization, with their algorithmic roles examined in detail. A pairwise compatibility matrix is proposed to characterize synergistic and conflicting interactions among strategies. Building on this analysis, we introduce a decision framework for selecting suitable acceleration strategies based on dataset characteristics and computational constraints. This framework, together with the taxonomy, combinability analysis, and scenario-based recommendations, establishes a rigorous foundation for understanding and systematically applying Fast Mean Shift methods.

Förderung

  • Ministry of Science and Higher Education of the Republic of Kazakhstan

Zitieren

APA

Mussabayev, R., Krassovitskiy, A., & Aristombayeva, M. (2025). Optimizing the Mean Shift Algorithm for Efficient Clustering. Mathematics, 13(21), 3408. https://doi.org/10.3390/math13213408

Vancouver

Mussabayev R, Krassovitskiy A, Aristombayeva M. Optimizing the Mean Shift Algorithm for Efficient Clustering. Mathematics. 2025;13(21):3408. doi:10.3390/math13213408

BibTeX
@article{Mussabayev2025,
  author = {Mussabayev, Rustam and Krassovitskiy, Alexander and Aristombayeva, Meruyert},
  title = {Optimizing the Mean Shift Algorithm for Efficient Clustering},
  journal = {Mathematics},
  year = {2025},
  volume = {13},
  number = {21},
  pages = {3408},
  doi = {10.3390/math13213408}
}
Kostenlos starten →