آمار

تعداد نشریات11
تعداد شماره‌ها237
تعداد مقالات2,398
تعداد مشاهده مقاله3,830,613
تعداد دریافت فایل اصل مقاله2,775,225
Asadpour, Mohammad, Pourbahrami, Shahin. (1404). A Novel Clustering Algorithm based on Natural Neighborhood and Radial Distribution Function. فناوری آموزش, (), -. doi: 10.22061/jecei.2025.12365.870
Mohammad Asadpour; Shahin Pourbahrami. "A Novel Clustering Algorithm based on Natural Neighborhood and Radial Distribution Function". فناوری آموزش, , , 1404, -. doi: 10.22061/jecei.2025.12365.870
Asadpour, Mohammad, Pourbahrami, Shahin. (1404). 'A Novel Clustering Algorithm based on Natural Neighborhood and Radial Distribution Function', فناوری آموزش, (), pp. -. doi: 10.22061/jecei.2025.12365.870
Asadpour, Mohammad, Pourbahrami, Shahin. A Novel Clustering Algorithm based on Natural Neighborhood and Radial Distribution Function. فناوری آموزش, 1404; (): -. doi: 10.22061/jecei.2025.12365.870

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

Journal of Electrical and Computer Engineering Innovations (JECEI)
مقالات آماده انتشار، پذیرفته شده، انتشار آنلاین از تاریخ 08 بهمن 1404
نوع مقاله: Original Research Paper
شناسه دیجیتال (DOI): 10.22061/jecei.2025.12365.870
نویسندگان
Mohammad Asadpour* 1؛ Shahin Pourbahrami2
1Computer Engineering Department, Faculty of Electrical and Computer Engineering, University of Tabriz, Tabriz, Iran.
2Department 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
آمار
تعداد مشاهده مقاله: 85


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