A review of clustering techniques and developments

被引:853
作者
Saxena, Amit [1 ]
Prasad, Mukesh [2 ]
Gupta, Akshansh [3 ]
Bharill, Neha [4 ]
Patel, Om Prakash [4 ]
Tiwari, Aruna [4 ]
Er, Meng Joo [5 ]
Ding, Weiping [6 ]
Lin, Chin-Teng [2 ]
机构
[1] Guru Ghasidas Vishwavidyalaya, Dept Comp Sci & IT, Bilaspur, India
[2] Univ Technol Sydney, Ctr Artificial Intelligence, Sydney, NSW, Australia
[3] Jawaharlal Nehru Univ, Sch Computat & Integrat Sci, New Delhi, India
[4] Indian Inst Technol Indore, Dept Comp Sci & Engn, Simrol, Madhya Pradesh, India
[5] Nanyang Technol Univ, Sch Elect & Elect Engn, Singapore, Singapore
[6] Nantong Univ, Sch Comp & Technol, Nantong, Peoples R China
基金
澳大利亚研究理事会;
关键词
Unsupervised learning; Clustering; Data mining; Pattern recognition; Similarity measures; FUZZY C-MEANS; UNSUPERVISED FEATURE-SELECTION; NEURAL-NETWORKS; PATTERN-CLASSIFICATION; SPATIAL DATA; ALGORITHMS; OPTIMIZATION; CLASSIFIERS; SCHEME;
D O I
10.1016/j.neucom.2017.06.053
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper presents a comprehensive study on clustering: exiting methods and developments made at various times. Clustering is defined as an unsupervised learning where the objects are grouped on the basis of some similarity inherent among them. There are different methods for clustering the objects such as hierarchical, partitional, grid, density based and model based. The approaches used in these methods are discussed with their respective states of art and applicability. The measures of similarity as well as the evaluation criteria, which are the central components of clustering, are also presented in the paper. The applications of clustering in some fields like image segmentation, object and character recognition and data mining are highlighted. (C) 2017 Elsevier B.V. All rights reserved.
引用
收藏
页码:664 / 681
页数:18
相关论文
共 195 条
[1]  
Agrawal R., 1998, SIGMOD Record, V27, P94, DOI 10.1145/276305.276314
[2]   Link communities reveal multiscale complexity in networks [J].
Ahn, Yong-Yeol ;
Bagrow, James P. ;
Lehmann, Sune .
NATURE, 2010, 466 (7307) :761-U11
[3]   A TABU SEARCH APPROACH TO THE CLUSTERING PROBLEM [J].
ALSULTAN, KS .
PATTERN RECOGNITION, 1995, 28 (09) :1443-1451
[4]   Computational experience on four algorithms for the hard clustering problem [J].
AlSultan, KS ;
Khan, MM .
PATTERN RECOGNITION LETTERS, 1996, 17 (03) :295-308
[5]  
[Anonymous], 1996, Advances in knowledge discovery and data mining
[6]  
[Anonymous], 1996, P ACM SIGMOD INT C M
[7]  
[Anonymous], 2010, THE NEW PRESS 0522
[8]  
[Anonymous], 1993, Proceedings of the 10th International Conference on Machine Learning
[9]  
[Anonymous], 2008, Introduction to information retrieval
[10]  
[Anonymous], 2008, MERRIAM WEBSTER ONLI