{"total":25,"rows":[{"id":"2111.03193","title":"Explainable k-means. Don't be greedy, plant bigger trees!","created":"2021-11-04","cited_by_count":15,"area":null},{"id":"2112.14718","title":"Shallow decision trees for explainable $k$-means clustering","created":"2021-12-29","cited_by_count":15,"area":null},{"id":"2204.04828","title":"Improved Approximations for Euclidean $k$-means and $k$-median, via Nested Quasi-Independent Sets","created":"2022-04-11","cited_by_count":14,"area":null},{"id":"2106.15566","title":"Near-Optimal Explainable $k$-Means for All Dimensions","created":"2021-06-29","cited_by_count":13,"area":null},{"id":"2107.00798","title":"Near-optimal Algorithms for Explainable k-Medians and k-Means","created":"2021-07-02","cited_by_count":13,"area":null},{"id":"2111.10912","title":"Johnson Coverage Hypothesis: Inapproximability of k-means and k-median in L_p metrics","created":"2021-11-21","cited_by_count":8,"area":null},{"id":"2207.07949","title":"A Nearly Tight Analysis of Greedy k-means++","created":"2022-07-16","cited_by_count":7,"area":null},{"id":"2202.00720","title":"Gradient Based Clustering","created":"2022-02-01","cited_by_count":5,"area":null},{"id":"2304.03146","title":"Parameterized Approximation Schemes for Clustering with General Norm Objectives","created":"2023-04-06","cited_by_count":5,"area":null},{"id":"2309.16384","title":"Multi-Swap $k$-Means++","created":"2023-09-28","cited_by_count":5,"area":null},{"id":"2202.10640","title":"Convergence of online $k$-means","created":"2022-02-22","cited_by_count":4,"area":null},{"id":"2208.09643","title":"The computational complexity of some explainable clustering problems","created":"2022-08-20","cited_by_count":4,"area":null},{"id":"2209.13762","title":"Consensus Knowledge Graph Learning via Multi-view Sparse Low Rank Block Model","created":"2022-09-28","cited_by_count":3,"area":null},{"id":"2205.10403","title":"Tackling Provably Hard Representative Selection via Graph Neural Networks","created":"2022-05-20","cited_by_count":2,"area":null},{"id":"2106.12959","title":"Differentially Private Algorithms for Clustering with Stability Assumptions","created":"2021-06-11","cited_by_count":1,"area":null},{"id":"2211.15744","title":"Sketch-and-solve approaches to k-means clustering by semidefinite programming","created":"2022-11-28","cited_by_count":1,"area":null},{"id":"2107.14442","title":"Distribution free optimality intervals for clustering","created":"2021-07-30","cited_by_count":0,"area":null},{"id":"2204.02489","title":"Pareto-optimal clustering with the primal deterministic information bottleneck","created":"2022-04-05","cited_by_count":0,"area":null},{"id":"2402.01302","title":"A Unified Framework for Center-based Clustering of Distributed Data","created":"2024-02-02","cited_by_count":0,"area":null},{"id":"2502.06163","title":"Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search","created":"2025-02-10","cited_by_count":0,"area":null},{"id":"2506.13533","title":"Learning Augmented Graph $k$-Clustering","created":"2025-06-16","cited_by_count":0,"area":null},{"id":"2508.10345","title":"Welfare-Centric Clustering","created":"2025-08-14","cited_by_count":0,"area":null},{"id":"2602.23023","title":"Low-degree Lower bounds for clustering in moderate dimension","created":"2026-02-26","cited_by_count":0,"area":null},{"id":"2603.20507","title":"Distributed Gradient Clustering: Convergence and the Effect of Initialization","created":"2026-03-20","cited_by_count":0,"area":null},{"id":"2609.18527","title":"Provable Guarantees for Spectral Structured Prediction","created":"2026-09-16","cited_by_count":0,"area":null}],"next_cursor":null}