PoAC: Problem-Oriented AutoML in Clustering

MCML Authors

Gabriel Marques Tavares

Dr.

→ Group Thomas Seidl
 Database Systems, Data Mining and AI

Abstract

This work presents the Problem-oriented AutoML in Clustering (PoAC) framework, a flexible approach to automating clustering tasks that addresses key limitations of existing AutoML solutions. Traditional methods typically rely on fixed sets of meta-features and predefined internal Cluster Validity Indices (CVIs), limiting their adaptability across different problem contexts. PoAC introduces a modular design in which the core methodology, comprising meta-feature extraction, surrogate model training, and optimization, is fixed, while the specific configuration of components is user-defined. This design allows users to dynamically instantiate PoAC for different clustering goals by selecting which meta-features to extract, which CVIs to optimize, and how to structure the learning task. The framework is algorithm-agnostic and can adapt to diverse clustering problems without retraining from scratch. In the visualization-oriented study, PoAC obtained the highest mean ARI and SIL and the lowest mean DBS among the evaluated AutoML frameworks. In the anomaly-detection study, it obtained higher F1 scores than IForest on most of the eight datasets and broadly comparable ROC AUC values. These findings are limited to the reported datasets, baselines, search spaces, and computational budgets.

article DTM+26

---

Machine Learning

115.254. Nov. 2026.

---

Authors

M. C. da Silva • G. M. Tavares • E. Medvet • S. B. Junior

---

Links

DOI

---

Research Area

 A3 | Computational Models