A Novel Clustering Algorithm based on Natural Neighborhood and Radial Distribution Function

Asadpour, Mohammad; Pourbahrami, Shahin

doi:10.22061/jecei.2025.12365.870

تعداد نشریات	15
تعداد شماره‌ها	239
تعداد مقالات	2,430
تعداد مشاهده مقاله	4,047,883
تعداد دریافت فایل اصل مقاله	2,939,777

	A Novel Clustering Algorithm based on Natural Neighborhood and Radial Distribution Function
Journal of Electrical and Computer Engineering Innovations (JECEI)
مقاله 5، دوره 14، شماره 2، مهر 2026، صفحه 351-364 اصل مقاله (1.08 M)
نوع مقاله: Original Research Paper
شناسه دیجیتال (DOI): 10.22061/jecei.2025.12365.870
نویسندگان
Mohammad Asadpour^* ¹؛ Shahin Pourbahrami²
¹Computer Engineering Department, Faculty of Electrical and Computer Engineering, University of Tabriz, Tabriz, Iran.
²Department of Computer Engineering, National University of Skills (NUS), Tehran, Iran.
تاریخ دریافت: 14 مهر 1404، تاریخ بازنگری: 30 آذر 1404، تاریخ پذیرش: 09 دی 1404
چکیده
Background and Objectives: One of the most important clustering methods is density-based clustering. This technique operates on the idea that clusters are regions of higher data density, separated by areas of lower density. Density Peak Clustering (DPC) is a modern density-based algorithm designed to efficiently identify cluster centers by constructing a decision graph. In this graph, points with high local density and a large distance from other high-density points are selected as cluster centers. Once these centers are determined, the remaining non-central points are assigned to clusters based on their proximity to the nearest center. However, DPC performs poorly on manifold datasets with varying densities and is highly sensitive to the selection of the cut-off distance parameter. Methods: To address these limitations and improve clustering performance, this study introduces an approach that employs the radial distribution function to quantify the relationship between data points and high-density regions. This method enables the estimation of the probability of finding neighboring points around a central or dense point, and a histogram is generated to represent these relationships. Results: Unlike traditional DPC, the proposed method eliminates the need for a distance cut-off parameter. The approach was implemented using the natural neighbor algorithm and the radial distribution function in a MATLAB environment. Conclusion: Experimental results demonstrated significant improvements in clustering accuracy and reductions in execution time compared to existing methods.
کلیدواژه‌ها
Clustering؛ Density Peaks؛ Natural Neighbor Algorithm؛ Radial Distribution Function؛ Cut-off Parameter

مراجع
[1] A. O’Hagan, A. White, “Improved model-based clustering performance using Bayesian initialization averaging,” Comput. Stat., 34(1): 201-231, 2019. [2] G. J. Oyewole, G. A. Thopil, “Data clustering: application and trends,” Artificial Intell. Rev., 56(7): 6439-6475, 2023. [3] M. Sharma, S. K. Dinkar, "A survey on evolutionary clustering algorithms and applications," in Applications of Advanced Optimization Techniques in Industrial Engineering, pp. 23–34: CRC Press, 2022. [4] K. Gorgani Firouzjah, J. Ghasemi, “Ensemble learning algorithm for power transformer health assessment using dissolved gas analysis,” J. Electr. Comput. Eng. Innovations, 13(2): 387-402, 2025. [5] T. BaniRostam, “Presenting a model of data anonymization in big data in the context of in-memory processing framework,” Available at SSRN 5161949, 2024. [6] M. Jubair, R. Hassan, A. H. M. Aman, H. Sallehudin, Z. G. Al-Mekhlafi, B. A. Mohammed, M. S. Alsaffar, “Optimization of clustering in wireless sensor networks: techniques and protocols,” Appl. Sci., 11(23): 11448, 2021. [7] E. Feser, H. Renski, H. Goldstein, “Clusters and economic development outcomes: An analysis of the link between clustering and industry growth,” Econ. Dev. Q., 22(4): 324–344, 2008. [8] G. Anderson, “Industry clustering for economic development,” Econ. Dev. Rev., 12(2):26, 1994. [9] H. Zhang, Y. Peng, “Image clustering: An unsupervised approach to categorize visual data in social science research,” Sociolog. Methods Res., 53(3): 1534–1587, 2024. [10] N. Iam-On, T. Boongoen, N. Naik, L. Yang, “Leveraging ensemble clustering for privacy-preserving data fusion: Analysis of big social-media data in tourism,” Inf. Sci., 686: 121336, 2025. [11] M. A. Sorkhi, E. Akbari, M. Rabbani, H. Motameni, “A dynamic density-based clustering method based on K-nearest neighbor,” Knowl. Inf. Syst., 66(5): 3005–3031, 2024. [12] A. Rodriguez, A. Laio, "Clustering by fast search and find of density peaks,” Science, 344: 1492–1496, 2014. [13] Y. Wang, J. Qian, M. Hassan, X. Zhang, T. Zhang, C. Yang, X. Zhou, F. Jia, “Density peak clustering algorithms: A review on the decade 2014–2023,” Expert Syst. Appl., 238: 121860, 2024. [14] S. Pourbahrami, M. A. Balafar, L. M. Khanli, Z. A. Kakarash, “A survey of neighborhood construction algorithms for clustering and classifying data points,” Comput. Sci. Rev., 38: 100315, 2020. [15] J. Liu, X. Liu, J. Xiong, Q. Liao, S. Zhou, S. Wang, Y. Yang, “Optimal neighborhood multiple kernel clustering with adaptive local kernels,” IEEE Trans. Knowl. Data Eng., 34(6): 2872–2885, 2020. [16] H. Zhou, Z. Wang, H. Chen, X. Wang, “A novel spectral clustering algorithm based on neighbor relation and Gaussian kernel function with only one parameter,” Soft Comput., 28(2): 981–989, 2024. [17] S. Pourbahrami, M. A. Balafar, L. M. Khanli, “ASVMK: A novel SVMs Kernel based on Apollonius function and density peak clustering,” Eng. Appl. Artif. Intell., 126: 106704, 2023. [18] S. Pourbahrami, “A neighborhood-based robust clustering algorithm using Apollonius function kernel,” Expert Syst. Appl., .248: 123407, 2024. [19] S. Pourbahrami, S. Azimpour, “A new method for detection of clustering based on four zones Apollonius circle,” Iran J. Comput. Sci., 3(1): 59–64, 2020. [20] N. Abdolmaleki, L. M. Khanli, M. Hashemzadeh, S. Pourbahrami, “ACQC: Apollonius circle‐based quantum clustering,” J. Comput. Sci., 64: 101877, 2022. [21] S. Ding, W. Du, X. Xu, T. Shi, Y. Wang, C. Li, “An improved density peaks clustering algorithm based on natural neighbor with a merging strategy,” Inf. Sci., 624: 252–276, 2023. [22] S. Ding, C. Li, X. Xu, L. Guo, L. Ding, X. Wu, “Horizontal federated density peaks clustering,” IEEE Trans. Neural Networks Learn Syst,, 2023. [23] J. Xie, X. Liu, M. Wang, “SFKNN-DPC: Standard deviation weighted distance based density peak clustering algorithm,” Inf. Sci., 653: 119788, 2024. [24] S. Pourbahrami, L. M. Khanli, S. Azimpour, “A novel and efficient data point neighborhood construction algorithm based on Apollonius circle,” Expert Syst. Appl., 115: 57–67, 2019. [25] S. Pourbahrami, L. M. Khanli, S. Azimpour, “Improving neighborhood construction with Apollonius region algorithm based on density for clustering,” Inf. Sci., 522: 227–240, 2020. [26] S. Pourbahrami, M. Hashemzadeh, “A geometric-based clustering method using natural neighbors,” Inf. Sci., 610: 694–706, 2022. [27] W. Durani, D. Mautz, C. Plant, C. Böhm, "DMDHC: Discovery of multi-density hierarchical cluster structures," in Proc. the 2025 SIAM International Conference on Data Mining (SDM): 261–269, 2025. [28] M. Ankerst, M. M. Breunig, H. P. Kriegel, J. Sander, “OPTICS: Ordering points to identify the clustering structure,” ACM Sigmod Rec., 28(2): 49–60, 1999. [29] R. J. Campello, D. Moulavi, A. Zimek, J. Sander, “Hierarchical density estimates for data clustering, visualization, and outlier detection,” ACM Trans. Knowl. Discovery Data (TKDD), 10(1): 1–51, 2015. [30] S. Sharma, N. Batra, "Comparative study of single linkage, complete linkage, and ward method of agglomerative clustering," in Proc. 2019 International Conference on Machine Learning, Big Data, Cloud and Parallel Computing (COMITCon): 568–573, 2019. [31] Q. Zhu, J. Feng, J. Huang, “Natural neighbor: A self-adaptive neighborhood method without parameter K,” Pattern Recognit. Lett., 80: 30–36, 2016. [32] P. Fränti, S. Sieranoja, “Clustering accuracy,” Appl. Comput. Intell., 4(1): 24-44, 2024. [33] M. E. Newman, G. T. Cantwell, J. G. Young, “Improved mutual information measure for clustering, classification, and community detection,” Phys. Rev. E, 101(4): 042304, 2020. [34] S. Zhang, H. S. Wong, Y. Shen, “Generalized adjusted rand indices for cluster ensembles,” Pattern Recognit., 45(6): 2214–2226, 2012.
آمار تعداد مشاهده مقاله: 213 تعداد دریافت فایل اصل مقاله: 19

سامانه مدیریت نشریات علمی. طراحی و پیاده سازی از سیناوب

پیوندهای مفید

آمار

A Novel Clustering Algorithm based on Natural Neighborhood and Radial Distribution Function