.png){kind=icon}
Return
Representative points clustering algorithm based on density factor and relevant degree
.png){kind=icon}
PRE
AI
DOI：10.1007/s13042-015-0451-5.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Most of the existing clustering algorithms are affected seriously by noise data and high cost of time. In this paper, on the basis of CURE algorithm, a representative points clustering algorithm based on density factor and relevant degree called RPCDR is proposed. The definition of density factor and relevant degree are presented. The primary representative point whose density factor is less than the prescribed threshold will be deleted directly. New representative points can be reselected from non representative points in corresponding cluster. Moreover, the representative points of each cluster are modeled by using K-nearest neighbor method. Relevant degree is computed by comprehensive considering the correlations of objects within a cluster and between different clusters. And then whether the two clusters need to merge is judged. The theoretic experimental results and analysis prove that RPCDR has better clustering accuracy and execution efficiency.
Keywords:
Clustering
Representative point
Density factor
Relevant degree
K-nearest neighbor method
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.7
Papers:
3.2K
Citations:
5.6K
Organization
Cited Papers
.png){kind=icon}
Is the Burgess concentric zonal theory of spatial differentiation still applicable to urban Canada?
PREAI
ShareSaveShareSaveShareSave
View more