Ensemble Clustering Based on Meta-Learning and Hyperparameter Optimization

Author:

Treder-Tschechlov Dennis1,Fritz Manuel1,Schwarz Holger1,Mitschang Bernhard1

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.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3