Combining density peaks clustering and gravitational search method to enhance data clustering

被引:15
作者
Sun, Liping [1 ,2 ]
Tao, Tao [3 ]
Zheng, Xiaoyao [1 ,2 ]
Bao, Shuting [1 ,2 ]
Luo, Yonglong [1 ,2 ]
机构
[1] Anhui Normal Univ, Sch Comp & Informat, Wuhu 241002, Peoples R China
[2] Anhui Prov Key Lab Network & Informat Secur, Wuhu 241002, Peoples R China
[3] Soochow Univ, Sch Comp Sci & Technol, Suzhou 215006, Peoples R China
基金
中国国家自然科学基金;
关键词
Data clustering; Gravitational search algorithm; Density peaks clustering; GSA-DPC algorithm; K-MEANS; ALGORITHM;
D O I
10.1016/j.engappai.2019.08.012
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Data clustering is a valuable field for extracting effective information and hidden patterns from datasets. In this paper we propose a clustering approach based on density peaks clustering (DPC) and a modified gravitational search algorithm (GSA), called GSA-DPC. To take advantage of the distance measure and nearest neighbor rule among the data points, our method simultaneously combines the distance and density mechanisms. Based on the optimized cluster center set selected by DPC working with density measure, the best clustering distribution is achieved according to the distance criterion of GSA. We compare the performance of GSA-DPC with other well-known clustering approaches, including density-based spatial clustering of applications with noise (DBSCAN), density peaks clustering, K-Means, spectral clustering (SC), grey wolf optimizer for clustering (GWO-C), gravitational search algorithm for clustering (GSA-C) and data clustering algorithm based on GSA and K-Means (GSA-KM). The experimental results indicate that GSA-DPC outperforms these competing approaches.
引用
收藏
页码:865 / 873
页数:9
相关论文
共 36 条
[11]   Particle swarm Optimized Density-based Clustering and Classification: Supervised and unsupervised learning approaches [J].
Guan, Chun ;
Yuen, Kevin Kam Fung ;
Coenen, Frans .
SWARM AND EVOLUTIONARY COMPUTATION, 2019, 44 (876-896) :876-896
[12]   Fast automatic estimation of the number of clusters from the minimum inter-center distance for k-means clustering [J].
Gupta, Avisek ;
Datta, Shounak ;
Das, Swagatam .
PATTERN RECOGNITION LETTERS, 2018, 116 :72-79
[13]   A comprehensive survey of traditional, merge-split and evolutionary approaches proposed for determination of cluster number [J].
Hancer, Emrah ;
Karaboga, Dervis .
SWARM AND EVOLUTIONARY COMPUTATION, 2017, 32 :49-67
[14]   A combined approach for clustering based on K-means and gravitational search algorithms [J].
Hatamlou, Abdolreza ;
Abdullah, Salwani ;
Nezamabadi-pour, Hossein .
SWARM AND EVOLUTIONARY COMPUTATION, 2012, 6 :47-52
[15]   Voronoi region-based adaptive unsupervised color image segmentation [J].
Hettiarachchi, R. ;
Peters, J. F. .
PATTERN RECOGNITION, 2017, 65 :119-135
[16]   Clustering Based on Dominant Set and Cluster Expansion [J].
Hou, Jian ;
Liu, Weixue .
ADVANCES IN KNOWLEDGE DISCOVERY AND DATA MINING, PAKDD 2017, PT II, 2017, 10235 :76-87
[17]   COMPARING PARTITIONS [J].
HUBERT, L ;
ARABIE, P .
JOURNAL OF CLASSIFICATION, 1985, 2 (2-3) :193-218
[18]   Functional data clustering: a survey [J].
Jacques, Julien ;
Preda, Cristian .
ADVANCES IN DATA ANALYSIS AND CLASSIFICATION, 2014, 8 (03) :231-255
[19]   Data clustering: A user's dilemma [J].
Jain, AK ;
Law, MHC .
PATTERN RECOGNITION AND MACHINE INTELLIGENCE, PROCEEDINGS, 2005, 3776 :1-10
[20]   Data clustering: A review [J].
Jain, AK ;
Murty, MN ;
Flynn, PJ .
ACM COMPUTING SURVEYS, 1999, 31 (03) :264-323