数据点的密度引力聚类新算法-计算机科学与探索.PDFVIP

ISSN 1673-9418 CODEN JKYTA8 E-mail: fcst@vip. 163.com Journal of Frontiers of Computer Science and Technology 1673-9418/2018/ 12(12)- 1996-11 Tel: +86-10 doi: 10.3778/j.issn. 1673-9418.1711034 数据点的密度引力聚类新算法* 温晓芳，杨志翀，陈 梅+ 兰州交通大学 电子与信息工程学院，兰州 730070 Density Attraction Clustering Algorithm Between Data Points WEN Xiaofang, YANG Zhichong, CHEN Mei+ School of Electronic and Information Engineering, Lanzhou Jiaotong University, Lanzhou 730070, China + Corresponding author: E-mail: chenmeilz@ WEN Xiaofang, YANG Zhichong, CHEN Mei. Density attraction clustering algorithm between data points. Journal of Frontiers of Computer Science and Technology, 2018, 12(12) ：1996-2006. Abstract: Existing clustering algorithms often fail in dealing with datasets with various clusters. By regarding each data point as a particle, a new robust density attracted clustering algorithm is proposed to better detect the cluster. First, the local density of a point is obtained according to the dense degree of its neighbors. Then, each point is assigned to its mutual nearest neighbor with greater density to form initial clusters. Next, the initial clusters including the same points are merged together to form the final clusters. By comparing the new algorithm with the three classical 索 and the three state-of-the-art methods on six various datasets respectively, the results show that the new proposed 探 algorithm shows the best performance, and can be used to find various clusters in datasets with different dimensions. Key words: clustering; various clusters; density attraction; local density 与