可解释聚类中深度减少的不可能性（英文版）

英文标题：Impossibility of Depth Reduction in Explainable Clustering中文摘要：本文研究可解释 K-means 和 K-median 聚类问题，证明了在欧几里得平面上，解释深度降低会导致聚类成本的无界损失，并将其扩展到 K-center 目标。英文摘要：Over the last few years Explainable Clustering has gathered a lot ofattention. Dasgupta et al. [ICML'20] initiated the study of explainable k-meansand k-median clustering problems where the explanation is captured by athreshold decision tree which partitions the space at each node using axisparallel hyperplanes. Recently, Laber et al. [Pattern