Nearly tight bounds on the price of explainability for the \(k\)-center and the maximum-spacing clustering problems

DOI10.1016/j.tcs.2023.113744OpenAlexW4319016951MaRDI QIDQ2686110

Lucas Saadi Murtinho, Eduardo Sany Laber

Publication date: 24 February 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2023.113744

zbMATH Keywords

clusteringdecision treesexplainability

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Interpretable clustering using unsupervised binary trees
• The Design of Approximation Algorithms
• Optimal classification trees

This page was built for publication: Nearly tight bounds on the price of explainability for the \(k\)-center and the maximum-spacing clustering problems