Evaluation and selection of clustering methods using a hybrid group MCDM

被引:46
作者
Barak, Sasan [1 ,2 ]
Mokfi, Taha [3 ]
机构
[1] VSB Tech Univ Ostrava, Fac Econ, Sokolska Trida 33, Ostrava 70200, Czech Republic
[2] Univ Lancaster, Lancaster Univ Management Sch, Dept Management Sci, Lancaster, England
[3] Univ Cent Florida, Dept Stat, Orlando, FL 32816 USA
关键词
Clustering; MCDM; Group TOPSIS; Group COPRAS; Particle Swarm Optimization; DECISION-MAKING; PARTICLE SWARM; ALGORITHMS; CLASSIFICATION; CRITERIA;
D O I
10.1016/j.eswa.2019.07.034
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Due to the lack of objective measures, the evaluation and prioritization of clustering methods is inherently challenging. Since their evaluation generally involves numerous criteria, it can be designed as a multiple criteria decision making (MCDM) problem and using multiple data sets, the problem can be formulated as a group MCDM modeling. In this paper, a MCDM-based framework is proposed to evaluate and rank a number of clustering methods. The proposed approach employs three group MCDM algorithms and a Borda count method which leads to a comprehensive, robust framework capable of evaluating and ranking multiple clustering models on manifold data sets (cases). Moreover, we introduce a hybrid data clustering algorithm which combines a particle swarm optimization (PSO) algorithm with a K-means clustering algorithm. Finally, a clustering comparison with regard to both external and internal evaluation indicators is another contribution of this paper. Six clustering methods are compared based on five evaluation measures. The results of comparative experiments on ten data sets indicate the effectiveness of the proposed hybrid clustering method. More importantly, the experimental results vividly demonstrate the effectiveness of the group MCDM-based evaluation on clustering model selection. (C) 2019 Elsevier Ltd. All rights reserved.
引用
收藏
页数:19
相关论文
共 69 条
[1]  
Aggarwal CC, 2014, CH CRC DATA MIN KNOW, P1
[2]  
[Anonymous], 1981, MULTIPLE ATTRIBUTE D
[3]  
[Anonymous], 1988, ALGORITHMS CLUSTERIN
[4]  
[Anonymous], 7 INT WORKSH FRONT H
[5]  
[Anonymous], 2013, ARXIV13017401
[6]  
[Anonymous], P IND C COMP VIS GRA
[7]  
Arthur D, 2007, PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P1027
[8]  
Bache K., 2013, UCI machine learning repository
[9]  
Baraldi A, 1999, IEEE T SYST MAN CY B, V29, P778, DOI 10.1109/3477.809032
[10]  
Berkhin P, 2006, GROUPING MULTIDIMENSIONAL DATA: RECENT ADVANCES IN CLUSTERING, P25