ResearchTrend.AI
The computational complexity of some explainable clustering problems

The computational complexity of some explainable clustering problems

E. Laber
ArXivPDFHTML

Papers citing "The computational complexity of some explainable clustering problems"

2 / 2 papers shown
Title
Impossibility of Depth Reduction in Explainable Clustering
Impossibility of Depth Reduction in Explainable Clustering
Cheng-Hao Deng
Surya Teja Gavva
S. KarthikC.
Parth Patel
Adarsh Srinivasan
21
1
0
04 May 2023
Shallow decision trees for explainable $k$-means clustering
Shallow decision trees for explainable kk-means clustering
E. Laber
Lucas Murtinho
F. Oliveira
21
24
0
29 Dec 2021