The computational complexity of some explainable clustering problems

DOI10.1016/J.IPL.2023.106437arXiv2208.09643MaRDI QIDQ6121425

Eduardo Sany Laber

Publication date: 26 March 2024

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2208.09643

zbMATH Keywords

computational complexityclusteringdecision treesexplainability

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Interpretable clustering using unsupervised binary trees
• Information Theoretical Clustering Is Hard to Approximate
• Unnamed Item

This page was built for publication: The computational complexity of some explainable clustering problems