Adaptive fuzzy clustering by fast search and find of density peaks

被引:74
作者
Bie, Rongfang [1 ]
Mehmood, Rashid [1 ,2 ]
Ruan, Shanshan [1 ]
Sun, Yunchuan [3 ]
Dawood, Hussain [4 ]
机构
[1] Beijing Normal Univ, Coll Informat Sci & Technol, Beijing 100875, Peoples R China
[2] Univ Management Sci & Informat Technol, Dept Comp Sci & Informat Technol, Kotli, Ajk, Pakistan
[3] Beijing Normal Univ, Sch Business, Beijing 100875, Peoples R China
[4] Univ Engn & Technol, Dept Comp Engn, Taxila, Pakistan
基金
中国国家自然科学基金;
关键词
Clustering; Decision graph; Fuzzy clustering; Density peaks; RECOGNITION; ALGORITHMS;
D O I
10.1007/s00779-016-0954-4
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Clustering by fast search and find of density peaks (CFSFDP) is proposed to cluster the data by finding of density peaks. CFSFDP is based on two assumptions that: a cluster center is a high dense data point as compared to its surrounding neighbors, and it lies at a large distance from other cluster centers. Based on these assumptions, CFSFDP supports a heuristic approach, known as decision graph to manually select cluster centers. Manual selection of cluster centers is a big limitation of CFSFDP in intelligent data analysis. In this paper, we proposed a fuzzy-CFSFDP method for adaptively selecting the cluster centers, effectively. It uses the fuzzy rules, based on aforementioned assumption for the selection of cluster centers. We performed a number of experiments on nine synthetic clustering datasets and compared the resulting clusters with the state-of-the-art methods. Clustering results and the comparisons of synthetic data validate the robustness and effectiveness of proposed fuzzy-CFSFDP method.
引用
收藏
页码:785 / 793
页数:9
相关论文
共 47 条
[41]  
Portnoy L., 2001, Proc. ACM CSS Workshop on Data Mining Applied to Security (DMSA), P5
[42]   Clustering by fast search and find of density peaks [J].
Rodriguez, Alex ;
Laio, Alessandro .
SCIENCE, 2014, 344 (6191) :1492-1496
[43]   LINEAR COHERENT BI-CLUSTERING VIA BEAM SEARCHING AND SAMPLE SET CLUSTERING [J].
Shi, Yi ;
Hasan, Maryam ;
Cai, Zhipeng ;
Lin, Guohui ;
Schuurmans, Dale .
DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2012, 4 (02)
[44]   Faster sequence homology searches by clustering subsequences [J].
Suzuki, Shuji ;
Kakuta, Masanori ;
Ishida, Takashi ;
Akiyama, Yutaka .
BIOINFORMATICS, 2015, 31 (08) :1183-1190
[45]   A maximum variance cluster algorithm [J].
Veenman, CJ ;
Reinders, MJT ;
Backer, E .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2002, 24 (09) :1273-1280
[46]   A Survey on Cyber Security for Smart Grid Communications [J].
Yan, Ye ;
Qian, Yi ;
Sharif, Hamid ;
Tipper, David .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2012, 14 (04) :998-1010
[47]   Retro: concept-based clustering of biomedical topical sets [J].
Yeganova, Lana ;
Kim, Won ;
Kim, Sun ;
Wilbur, W. John .
BIOINFORMATICS, 2014, 30 (22) :3240-3248