Impossibility of Depth Reduction in Explainable Clustering

Over the last few years Explainable Clustering has gathered a lot of attention. Dasgupta et al. [ICML'20] initiated the study of explainable k-means and k-median clustering problems where the explanation is captured by a threshold decision tree which partitions the space at each node using axis...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Deng, Chengyuan, Gavva, Surya Teja, S, Karthik C, Patel, Parth, Srinivasan, Adarsh
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Computational Complexity Computer Science - Computational Geometry Computer Science - Data Structures and Algorithms Computer Science - Learning
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!