ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2208.09643
  4. Cited By
The computational complexity of some explainable clustering problems

The computational complexity of some explainable clustering problems

20 August 2022
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
25
1
0
04 May 2023
Shallow decision trees for explainable $k$-means clustering
Shallow decision trees for explainable kkk-means clustering
E. Laber
Lucas Murtinho
F. Oliveira
32
24
0
29 Dec 2021
1