Interpretable clustering via optimal multi-way decision trees

Sicherheitsmeldung mit Schweregrad noch nicht bewertet. Technische Details im Tab „Originaltext“; empfohlene Schritte in der Checkliste.

Originaltext der Quelle (nicht übersetzt) – die deutsche Zusammenfassung findest du im Tab „Kurzfassung".

arXiv:2602.13586v2 Announce Type: replace Abstract: Clustering is a fundamental unsupervised learning technique for uncovering data structures to facilitate knowledge discovery and decision-making. While clustering accuracy is crucial, interpretability significantly impacts the practical value of clustering results, particularly in high-risk decision-making contexts. Although decision-tree-based clustering methods offer high interpretability through explicit splitting rules, existing approaches often rely on local greedy search or require expensive computational costs limited to binary splits, resulting in deeper, less interpretable trees. To overcome these limitations, we establish a high-performance computational framework named Interpretable Clustering via Optimal Multi-way Trees (ICOMT). We make three primary contributions. First, we propose a new discretization method for numerical features using one-dimensional K-means clustering to capture data distributions. Second, we formulate a binary linear optimization (BLO) problem to guarantee tree optimality. Third, extensive validation on four public datasets demonstrates that our ICOMT method outperforms existing baselines, achieving superior clustering accuracy while maintaining shallow, concise tree structures.

Vollständiger Originalartikel ↗

• Betroffenheit im eigenen Stack prüfen: Versionen/Komponenten abgleichen.
• Originalquelle / Hersteller-Advisory lesen: https://arxiv.org/abs/2602.13586
• Verfügbaren Patch oder Workaround einspielen und dokumentieren.