Affiliation:
1. University of Stuttgart, Stuttgart, Germany
Abstract
Efficient clustering algorithms, such as
k
-Means, are often used in practice because they scale well for large datasets. However, they are only able to detect simple data characteristics. Ensemble clustering can overcome this limitation by combining multiple results of efficient algorithms. However, analysts face several challenges when applying ensemble clustering, i. e., analysts struggle to (a) efficiently generate an ensemble and (b) combine the ensemble using a suitable consensus function with a corresponding hyperparameter setting. In this paper, we propose EffEns, an efficient ensemble clustering approach to address these challenges. Our approach relies on meta-learning to learn about dataset characteristics and the correlation between generated base clusterings and the performance of consensus functions. We apply the learned knowledge to generate appropriate ensembles and select a suitable consensus function to combine their results. Further, we use a state-of-the-art optimization technique to tune the hyperparameters of the selected consensus function. Our comprehensive evaluation on synthetic and real-world datasets demonstrates that EffEns significantly outperforms state-of-the-art approaches w.r.t. accuracy and runtime.
Publisher
Association for Computing Machinery (ACM)
Reference66 articles.
1. Ebrahim Akbari et al. 2015. Hierarchical cluster ensemble selection. Engineering Applications of Artificial Intelligence (2015).
2. MFE: Towards reproducible meta-feature extraction;Edesio Alcobaça;Journal of Machine Learning Research,2020
3. Mihael Ankerst et al. 1999. OPTICS: Ordering Points to Identify the Clustering Structure. In ACM SIGMOD.
4. D. Arthur and Vassilvitskii. 2007. k-means++: The Advantages of Careful Seeding. In Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics Philadelphia, 1027--1035.
5. Hanan Ayad and Mohamed Kamel. 2003. Finding Natural Clusters Using Multi-Clusterer Combiner Based on Shared Nearest Neighbors. In MCS.