Skip to content
Microsystems, Electronics and Acoustics
ISSN 2523-4447 · e‑ISSN 2523-4455 Open Access · CC BY-SA 4.0
Vol. 30 · Issue 3 · 2025 Dec 23, 2025 Electronic Systems and Signals

Clustering Method Using Cardinal Number Vectors

OA
Olena Olehivna Abakumova Corresponding Національний технічний університет України «Київський політехнічний інститут імені Ігоря Сікорського» Ukraine
VZ
Valerii Yakovych Zhuikov Національний технічний університет України «Київський політехнічний інститут імені Ігоря Сікорського» Ukraine
ML
Mykola O. Lukianov Політехніка Гданська Poland
Pages344933.1-344933.7 PublishedDec 23, 2025
VOL 30 · ISS 3 · 2025 View issue

Abstract

In modern technical systems, clustering serves as a key procedure for structuring, analyzing, and interpreting large volumes of data, which in turn enhances decision-making efficiency and the optimization of system processes. This study presents a comparative analysis of the main groups of clustering methods and proposes a novel approach based on the powerful mathematical framework of cardinal numbers. The theoretical foundations for constructing cardinal number vectors are revealed, positioning them as a mathematical tool for data representation in clustering tasks. The proposed approach defines object distances within a selected orthogonal basis using the calculated cardinalities of abstract set sequences represented as vectors of cardinal numbers. The study explores the formation of these vectors and the computation of corresponding similarity metrics, followed by the generation of a distance matrix. A practical example illustrates the calculation of distances between three functions and a reference function based on their respective cardinal number vectors. It is demonstrated that altering the basis or projections according to the technical problem allows for the formation of different clusters, reflecting the flexibility and adaptability of the proposed method. The calculations are formalized, straightforward, and easily algorithmized, which enables the implementation of dynamic clustering. This approach holds significant promise for use in intelligent data analysis systems and information processing in electronic devices.

Keywords

References

  1. O. Kyrylenko, B. Stognii, S. Denysiuk, and M. Sopel, “SMART-MONITORING OF ELECTRICAL POWER SYSTEMS”, Tekhnichna Elektrodynamika, vol. 2024, no. 5, pp. 48–62, Aug. 2024. DOI: https://doi.org/10.15407/techned2024.05.048 .
  2. G. J. Oyewole and G. A. Thopil, “Data clustering: application and trends”, Artificial Intelligence Review, vol. 56, no. 7, pp. 6439–6475, Nov. 2022. DOI: https://doi.org/10.1007/s10462-022-10325-y .
  3. B. S. Everitt, S. Landau, M. Leese, D. Stahl, Cluster Analysis, London, Wiley, 2011, 352 p. DOI: https://doi.org/10.1002/9780470977811
  4. P.-N. Tan, M. Steinbach, А. Karpatne, V. Kumar, Introduction to Data Mining. 2nd ed. Boston, MA: Pearson, 2021, 856 p.
  5. A. Ultsch and J. Lötsch, “Euclidean distance-optimized data transformation for cluster analysis in biomedical data (EDOtrans)”, BMC Bioinformatics, vol. 23, no. 1, Jun. 2022. DOI: https://doi.org/10.1186/s12859-022-04769-w
  6. S. A. Afghani and W. Y. M. Putra, “Clustering with Euclidean Distance, Manhattan - Distance, Mahalanobis - Euclidean Distance, and Chebyshev Distance with Their Accuracy”, Indonesian Journal of Statistics and Its Applications, vol. 5, no. 2, pp. 369–376, Jun. 2021. DOI: https://doi.org/10.29244/ijsa.v5i2p369-376
  7. Y. Shim, S.-W. Choi, M.-G. Yang, K.-Y. Chung, and K.-H. Baek, “Energy Efficient Distance Computing: Application to K-Means Clustering”, Electronics, vol. 11, no. 3, p. 298, Jan. 2022. DOI: https://doi.org/10.3390/electronics11030298 .
  8. M. Sari and A. Armansyah, “Manhattan Metric Technique in K-Means Clustering for Data Grouping”, Journal of Information Systems and Informatics, vol. 6, no. 3, pp. 1945–1961, Sep. 2024. DOI: https://doi.org/10.51519/journalisi.v6i3.841
  9. D. Al-Shammary, E. Hakem, A. M. Mahdi, A. Ibaida, and K. Ahmed, “A novel brain EEG clustering based on Minkowski distance to improve intelligent epilepsy diagnosis”, Informatics in Medicine Unlocked, vol. 47, p. 101492, Jan. 2024. DOI: https://doi.org/10.1016/j.imu.2024.101492 .
  10. S. Biswas, A. Fole, N. Khare, and P. Agrawal, “Enhancing correlated big data privacy using differential privacy and machine learning”, Journal of Big Data, vol. 10, no. 1, Mar. 2023. DOI: https://doi.org/10.1186/s40537-023-00705-8
  11. N. Wiroonsri, “Clustering performance analysis using a new correlation-based cluster validity index”, Pattern Recognition, vol. 145, p. 109910, Jan. 2024. DOI: https://doi.org/10.1016/j.patcog.2023.109910 .
  12. J. AlShaqsi, W. Wang, O. Drogham, and R. S. Alkhawaldeh, “Quantitative and qualitative similarity measure for data clustering analysis”, Cluster Computing, vol. 27, no. 10, pp. 14977–15002, Aug. 2024. DOI: https://doi.org/10.1007/s10586-024-04664-4 .
  13. X. Ran, Y. Xi, Y. Lu, X. Wang, and Z. Lu, “Comprehensive survey on hierarchical clustering algorithms and the recent developments”, Artificial Intelligence Review, vol. 56, no. 8, pp. 8219–8264, Dec. 2022. DOI: https://doi.org/10.1007/s10462-022-10366-3 .
  14. M. Jasiński, T. Sikorski, Z. Leonowicz, K. Borkowski, and E. Jasińska, “The Application of Hierarchical Clustering to Power Quality Measurements in an Electrical Power Network with Distributed Generation”, Energies, vol. 13, no. 9, p. 2407, May 2020. DOI: https://doi.org/10.3390/en13092407
  15. A. M. Ikotun, A. E. Ezugwu, L. Abualigah, B. Abuhaija, and J. Heming, “K-means clustering algorithms: A comprehensive review, variants analysis, and advances in the era of big data”, Information Sciences, vol. 622, pp. 178–210, Apr. 2023. DOI: https://doi.org/10.1016/j.ins.2022.11.139 .
  16. M. Ahmed, R. Seraj, and S. M. S. Islam, “The k-means Algorithm: A Comprehensive Survey and Performance Evaluation”, Electronics, vol. 9, no. 8, p. 1295, Aug. 2020. DOI: https://doi.org/10.3390/electronics9081295 .
  17. Y. Terada, “Strong consistency of factorial $$K$$ K -means clustering”, Annals of the Institute of Statistical Mathematics, vol. 67, no. 2, pp. 335–357, Mar. 2014. DOI: https://doi.org/10.1007/s10463-014-0454-0 .
  18. E. Schubert, J. Sander, M. Ester, H. P. Kriegel, and X. Xu, “DBSCAN Revisited, Revisited: Why and How You Should (Still) Use DBSCAN”, ACM Transactions on Database Systems, vol. 42, no. 3, pp. 1–21, Jul. 2017. DOI: https://doi.org/10.1145/3068335 .
  19. D. K. Kotary and S. J. Nanda, “A Distributed Neighbourhood DBSCAN Algorithm for Effective Data Clustering in Wireless Sensor Networks”, Wireless Personal Communications, vol. 121, no. 4, pp. 2545–2568, Aug. 2021. DOI: https://doi.org/10.1007/s11277-021-08836-y .
  20. X. Yang, C. Xie, K. Zhou, S. Song, J. Yang, and B. Li, “Towards attributed graph clustering using enhanced graph and reconstructed graph structure”, Artificial Intelligence Review, vol. 57, no. 11, Sep. 2024. DOI: https://doi.org/10.1007/s10462-024-10958-1 .
  21. A. S. Tarasenko, V. B. Berikov, I. A. Pestunov, S. A. Rylov, and P. S. Ruzankin, “A fast consistent grid-based clustering algorithm”, Pattern Analysis and Applications, vol. 27, no. 4, Nov. 2024. DOI: https://doi.org/10.1007/s10044-024-01354-0 .
  22. I. Strelkovska, I. Solovska, Yu. Strelkovska, V. Paskalenko, “Kompleksna splain-aproksymatsiia v zadachakh pozytsionuvannia”, Visti vyshchykh uchbovykh zakladiv. Radioelektronika, № 65 (7), pp. 445-456, 2022. DOI: https://doi.org/10.20535/S0021347022100028 .
  23. M. Du and F. Wu, “Grid-Based Clustering Using Boundary Detection”, Entropy, vol. 24, no. 11, p. 1606, Nov. 2022. DOI: https://doi.org/10.3390/e24111606 .
  24. M. Al Jreidy, J. Constantin, F. Dornaika, and D. Hamad, “Clustering using graph convolution networks”, Progress in Artificial Intelligence, Jan. 2024. DOI: https://doi.org/10.1007/s13748-023-00310-z .
  25. C. Weber, D. Ray, A. Valverde, J. Clark, and K. Sharma, “Gaussian mixture model clustering algorithms for the analysis of high-precision mass measurements”, Nuclear Instruments and Methods in Physics Research Section A: Accelerators, Spectrometers, Detectors and Associated Equipment, vol. 1027, p. 166299, Mar. 2022. DOI: https://doi.org/10.1016/j.nima.2021.166299 .
  26. S. Sarkar, V. Melnykov, and R. Zheng, “Gaussian mixture modeling and model-based clustering under measurement inconsistency”, Advances in Data Analysis and Classification, vol. 14, no. 2, pp. 379–413, May 2020. DOI: https://doi.org/10.1007/s11634-020-00393-9 .
  27. Y. Jie, X. Li, M. wang, F. Zhou, and H. Tan, “Medical image fusion based on extended difference-of-Gaussians and edge-preserving”, Expert Systems with Applications, vol. 227, p. 120301, Oct. 2023. DOI: https://doi.org/10.1016/j.eswa.2023.120301 .
  28. H. Huang, “Fuzzy K-means clustering with reconstructed information”, International Journal of Machine Learning and Cybernetics, vol. 16, no. 1, pp. 43–53, Jun. 2024. DOI: https://doi.org/10.1007/s13042-024-02167-7 .
  29. A. Javed, D. M. Rizzo, B. S. Lee, and R. Gramling, “Somtimes: self organizing maps for time series clustering and its application to serious illness conversations”, Data Mining and Knowledge Discovery, vol. 38, no. 3, pp. 813–839, Oct. 2023. DOI: https://doi.org/10.1007/s10618-023-00979-9 .
  30. M. R. Basarab and K. O. Ivanko, “Deep Learning for the Detection and Classification of Diabetic Retinopathy Stages”, Microsystems, Electronics and Acoustics, vol. 29, no. 2, Aug. 2024. DOI: https://doi.org/10.20535/2523-4455.mea.309642 .
  31. D. S. Zaruba, M. Y. Shvets, and Y. V. Khokhlov, “Machine Learning for a Power Consumption and Generation Prediction”, Microsystems, Electronics and Acoustics, vol. 24, no. 6, pp. 17–21, Dec. 2019. DOI: https://doi.org/10.20535/2523-4455.2019.24.6.186996 .
  32. B. Zhou, B. Lu, S. Saeidlou, “A Hybrid Clustering Method Based on the Several Diverse Basic Clustering and Meta-Clustering Aggregation Technique”, Cybernetics and Systems, vol. 55, no. 1, pp. 203 229, 2024. DOI: https://doi.org/10.1080/01969722.2022.2110682 .
  33. H. Nabli, R. Ben Djemaa, and I. Amous Ben Amor, “Improved clustering-based hybrid recommendation system to offer personalized cloud services”, Cluster Computing, vol. 27, no. 3, pp. 2845–2874, Aug. 2023. DOI: https://doi.org/10.1007/s10586-023-04119-2 .
  34. C. J. Date, An Introduction to Database Systems, 8th ed. Boston, MA, Addison-Wesley Professional, 2003, 1024 p.
§ 06 — Related

Similar articles in this journal

Related peer-reviewed studies published in this journal.
View all issues

Quasistatic Identification of The Shading Structure of Solar Panels by The Method of Cardinal Number Vectors

PhD, Assoc. Prof. Olena Olehivna Abakumova, Dr.Sc.(Eng.), Prof. Valerii Yakovych Zhuikov, Mykola O. Lukianov

In the article the problem of identification the shading structure of solar panels is considered. The relevance of the study is conditioned by the necessity of rapid and…

#solar panels #photovoltaic surface #shadow structure modeling #quasistatic identification
p. 362283.1-362283.7
10.20535/2523-4455.mea.362283

A A Complex Method for Non-invasive Fetal Electrocardiogram Signal Extraction and Cardiac Arrhythmia Classification

Dmytro A. Shevchuk, PhD, Assoc. Prof. Nataliia Heorhiivna Ivanushkina

This study is devoted to the development of a complex method for extracting the fetal electrocardiogram (fECG) from non-invasive abdominal recordings and for the…

#abdominal electrocardiogram #fetal electrocardiogram #arrhythmia #blind source separation
p. 356487.1-356487.11
10.20535/2523-4455.mea.356487

Simulation Modeling of a Filter-Compensating Converter for a Three-Phase Three-Wire Network

Ivan Andriiovych Vakulenko, PhD, Assoc. Prof. Dmytro Anatoliiovych Mykolaiets, PhD, Assoc. Prof. Kateryna Serhiivna Klen

This paper addresses the critical issue of power quality degradation in modern power systems caused by the proliferation of non-linear loads. The study focuses on the…

#filter-compensating converter #three-phase three-wire network #power quality #total harmonic distortion
p. 361138.1-361138.6
10.20535/2523-4455.mea.361138

Most read articles by the same author(s)

Similar Articles

1-10 of 64

You may also start an advanced similarity search for this article.