A new method for hierarchical clustering combination

被引:28
作者
Mirzaei, Abdolreza [1 ]
Rahmati, Mohammad [1 ]
Ahmadi, Majid [2 ]
机构
[1] Amirkabir Univ Technol, Dept Comp Engn, Tehran 15914, Iran
[2] Univ Windsor, Dept Elect & Comp Engn, Windsor, ON N9B 3P4, Canada
关键词
Clustering; hierarchical clustering; cluster ensembles; clustering combination;
D O I
10.3233/IDA-2008-12603
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In the field of pattern recognition, combining different classifiers into a robust classifier is a common approach for improving classification accuracy. Recently, this trend has also been used to improve clustering performance especially in non-hierarchical clustering approaches. Generally hierarchical clustering is preferred in comparison with the partitional clustering for applications when the exact number of the clusters is not determined or when we are interested in finding the relation between clusters. To the best of our knowledge clustering combination methods proposed so far are based on partitional clustering and hierarchical clustering has been ignored. In this paper, a new method for combining hierarchical clustering is proposed. In this method, in the first step the primary hierarchical clustering dendrograms are converted to matrices. Then these matrices, which describe the dendrograms, are aggregated (using the matrix summation operator) into a final matrix with which the final clustering is formed. The effectiveness of different well known dendrogram descriptors and the one proposed by us for representing the dendrograms are evaluated and compared. The results show that all these descriptor work well and more accurate results (hierarchy of clusters) are obtained using hierarchical combination than combination of partitional clusterings.
引用
收藏
页码:549 / 571
页数:23
相关论文
共 50 条
[21]   Hierarchical Means Clustering [J].
Maurizio Vichi ;
Carlo Cavicchia ;
Patrick J. F. Groenen .
Journal of Classification, 2022, 39 :553-577
[22]   K-centroid link: a novel hierarchical clustering linkage method [J].
Dogan, Alican ;
Birant, Derya .
APPLIED INTELLIGENCE, 2022, 52 (05) :5537-5560
[23]   Belief hierarchical clustering [J].
Maalel, Wiem ;
Zhou, Kuang ;
Martin, Arnaud ;
Elouedi, Zied .
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8764 :68-76
[24]   K-centroid link: a novel hierarchical clustering linkage method [J].
Alican Dogan ;
Derya Birant .
Applied Intelligence, 2022, 52 :5537-5560
[25]   Hierarchical Means Clustering [J].
Vichi, Maurizio ;
Cavicchia, Carlo ;
Groenen, Patrick J. F. .
JOURNAL OF CLASSIFICATION, 2022, 39 (03) :553-577
[26]   A hierarchical clustering method for multivariate geostatistical data [J].
Fouedjio, Francky .
SPATIAL STATISTICS, 2016, 18 :333-351
[27]   Improved metaheuristics for the quartet method of hierarchical clustering [J].
Consoli, Sergio ;
Korst, Jan ;
Pauws, Steffen ;
Geleijnse, Gijs .
JOURNAL OF GLOBAL OPTIMIZATION, 2020, 78 (02) :241-270
[28]   Heuristic Approaches for the Quartet Method of Hierarchical Clustering [J].
Consoli, Sergio ;
Darby-Dowman, Kenneth ;
Geleijnse, Gijs ;
Korst, Jan ;
Pauws, Steffen .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2010, 22 (10) :1428-1443
[29]   A hierarchical clustering method: Applications to educational data [J].
Oviedo, Byron ;
Moral, Serafin ;
Puris, Amilkar .
INTELLIGENT DATA ANALYSIS, 2016, 20 (04) :933-951
[30]   Improved metaheuristics for the quartet method of hierarchical clustering [J].
Sergio Consoli ;
Jan Korst ;
Steffen Pauws ;
Gijs Geleijnse .
Journal of Global Optimization, 2020, 78 :241-270