The Principle of Class Separation and the Dependence of Clustering Results on the Distance Measure

Authors

  • K.D. Abdullaev National University of Uzbekistan named after Mirzo Ulugbek Author

DOI:

https://doi.org/10.71310/pcam.5_76.2026.03

Keywords:

cluster analysis, class separation principle, local density, distance measure, median partitioning, boundary objects

Abstract

The article considers a methodology for cluster analysis of multidimensional objects based on the calculation of local density, the initial division of objects into two classes K1 and K2, the identification of boundary objects, the adjustment of class composition, and subsequent grouping according to the connectivity relation. The influence of the initial partitioning rule and the selected distance measure on the resulting clustering structure is investigated. The partitioning rules used are partitioning based on the mean local density and median partitioning of an ordered sequence of density values. For comparative analysis, the Euclidean, Manhattan, Chebyshev, Canberra, and Hamming distance measures are considered. The main characteristics of the results are the final composition of the classes, the number of objects transferred between classes, the number of groups formed, the composition of the groups, and the group compactness measure Ω(E0). It is shown that the proposed clustering methodology makes it possible to form groups without specifying their number in advance and to compare the resulting structures obtained using different distance measures. The results confirm that the choice of distance measure and the initial partitioning rule significantly affects the number of groups, their composition, and the group compactness measure. The methodology can be used for the analysis of multidimensional data in tasks involving the identification of hidden relationships, boundary objects, and components of the group structure.

References

Ignatyev N. A., Zguralskaya Ye. N. Klasternyy analiz s primeneniyem obucheniya na osnove otnosheniy svyazannosti i plotnosti raspredeleniya // Vestnik Tomskogo gosudarstvennogo universiteta. Upravleniye, vychislitel'naya tekhnika i informatika. — 2024. — № 68. — S. 66–74.

Ignatyev N. A. Structure choice for relations between objects in metric classification algorithms // Pattern Recognition and Image Analysis. — 2018. — Vol. 28, №4. — P. 590–597. — doi: https://doi.org/10.1134/S1054661818040132.

Kleinberg J. An impossibility theorem for clustering // Advances in Neural Information Processing Systems 15 (NIPS 2002). — Cambridge: MIT Press, 2003. — P. 463–470. — URL: https://www.cs.cornell.edu/home/kleinber/nips15.pdf.

Sivogolovko Ye. V. Metody otsenki kachestva chotkoy klasterizatsii // Komp'yuternyye instrumenty v obrazovanii. — 2011. — № 4. — S. 14–31.

Shili H. Clustering in big data analytics: a systematic review and comparative analysis // Scientific and Technical Journal of Information Technologies, Mechanics and Optics. — 2023. — Vol. 23, №5. — P. 967–979. — doi: https://doi.org/10.17586/2226-1494-2023-23-5-967-979.

Ionosphere Data Set // UCI Machine Learning Repository. — URL: https://archive.ics.uci.edu/dataset/52/ionosphere

Ester M., Kriegel H.-P., Sander J., Xu X. A density-based algorithm for discovering clusters in large spatial databases with noise // Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD-96). — Portland: AAAI Press, 1996. — P. 226–231.

Jain A. K., Murty M. N., Flynn P. J. Data clustering: a review // ACM Computing Surveys. — 1999. — Vol. 31, №3. — P. 264–323. — doi: https://doi.org/10.1145/331499.331504.

Schubert E., Sander J., Ester M., Kriegel H.-P., Xu X. DBSCAN revisited, revisited: why and how you should (still) use DBSCAN // ACM Transactions on Database Systems. — 2017. — Vol. 42, №3. — Art. 19. — doi: https://doi.org/10.1145/3068335.

Campello R. J. G. B., Moulavi D., Sander J. Density-based clustering based on hierarchical density estimates // Advances in Knowledge Discovery and Data Mining. PAKDD 2013. Lecture Notes in Computer Science. — Berlin: Springer, 2013. — Vol. 7819. — P. 160–172. — doi: https://doi.org/10.1007/978-3-642-37456-2_14.

McInnes L., Healy J., Astels S. hdbscan: Hierarchical density based clustering // Journal of Open Source Software. — 2017. — Vol. 2, №11. — P. 205. — doi: https://doi.org/10.21105/joss.00205.

Dunn J. C. Well-separated clusters and optimal fuzzy partitions // Journal of Cybernetics. — 1974. — Vol. 4, №1. — P. 95–104. — doi: https://doi.org/10.1080/01969727408546059.

Hubert L., Arabie P. Comparing partitions // Journal of Classification. — 1985. — Vol. 2. — P. 193–218. — doi: https://doi.org/10.1007/BF01908075.

Aydagulov R. R., Glavatskiy S.T., Mikhalov A. V. Metody osredneniya v zadachakh klasterizatsii bol'shikh dannykh // Intellektual'nyye sistemy. Teoriya i prilozheniya. — 2021. — T. 25, № 4. — S. 12–18.

Downloads

Published

2026-11-02

Issue

Section

Статьи