.png){kind=icon}
Return
Clustering ensemble method
.png){kind=icon}
OA
AI
DOI：10.1007/s13042-017-0756-7.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A clustering ensemble aims to combine multiple clustering models to produce a better result than that of the individual clustering algorithms in terms of consistency and quality. In this paper, we propose a clustering ensemble algorithm with a novel consensus function named Adaptive Clustering Ensemble. It employs two similarity measures, cluster similarity and a newly defined membership similarity, and works adaptively through three stages. The first stage is to transform the initial clusters into a binary representation, and the second is to aggregate the initial clusters that are most similar based on the cluster similarity measure between clusters. This iterates itself adaptively until the intended candidate clusters are produced. The third stage is to further refine the clusters by dealing with uncertain objects to produce an improved final clustering result with the desired number of clusters. Our proposed method is tested on various real-world benchmark datasets and its performance is compared with other state-of-the-art clustering ensemble methods, including the Co-association method and the Meta-Clustering Algorithm. The experimental results indicate that on average our method is more accurate and more efficient.
Keywords:
Clustering ensemble
K-means
Similarity measurement
Machine learning
Data mining
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.7
Papers:
3.2K
Citations:
5.6K
Organization
Cited Papers
ShareSaveShareSaveShareSavePopulation-based otoscopic and audiometric assessment of a birth cohort recruited for a pneumococcal vaccine trial 15–18 years earlier: a protocol.png)
BMJ OpenOAAI
BMJ OpenIF0
OAAIShareSave
View more