Search Results for author:
Found 2 papers, 1 papers with code
Impossibility of Depth Reduction in Explainable Clustering
Formally, we show that there exists a data set X in the Euclidean plane, for which there is a decision tree of depth k-1 whose k-means/k-median cost matches the optimal clustering cost of X, but every decision tree of depth less than k-1 has unbounded cost w. r. t.
Clustering Categorical Data: Soft Rounding k-modes
Over the last three decades, researchers have intensively explored various clustering tools for categorical data analysis.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
