TL;DR
This paper introduces MARCO-GE, a meta-learning framework that automates clustering algorithm selection by transforming datasets into graphs and using graph neural networks to recommend top algorithms, improving accuracy and generalization.
Contribution
The paper presents a novel graph-based meta-learning approach for automated clustering algorithm recommendation, outperforming existing methods in predictive accuracy and generalization.
Findings
MARCO-GE achieves superior recommendation accuracy over state-of-the-art methods.
The approach effectively generalizes across diverse datasets and clustering measures.
Extensive experiments validate the robustness and effectiveness of MARCO-GE.
Abstract
The widespread adoption of machine learning (ML) techniques and the extensive expertise required to apply them have led to increased interest in automated ML solutions that reduce the need for human intervention. One of the main challenges in applying ML to previously unseen problems is algorithm selection - the identification of high-performing algorithm(s) for a given dataset, task, and evaluation measure. This study addresses the algorithm selection challenge for data clustering, a fundamental task in data mining that is aimed at grouping similar objects. We present MARCO-GE, a novel meta-learning approach for the automated recommendation of clustering algorithms. MARCO-GE first transforms datasets into graphs and then utilizes a graph convolutional neural network technique to extract their latent representation. Using the embedding representations obtained, MARCO-GE trains a ranking…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
