Research map / Learning theory and algorithms / Clustering

Simple, Scalable and Effective Clustering via One-Dimensional Projections

NeurIPS 2023 · Learning theory and algorithms › Clustering · approach: k-means++ seeding analysis · 1 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Closest papers by meaning

• Sparse Embedded $k$-Means Clustering (NeurIPS 2017 · similarity 0.92)
• A Sampling-Based Approach for Efficient Clustering in Large Datasets (CVPR 2022 · similarity 0.91)
• Improved Learning-augmented Algorithms for k-means and k-medians Clustering (ICLR 2023 · similarity 0.91)
• Simple and Scalable Sparse k-means Clustering via Feature Ranking (NeurIPS 2020 · similarity 0.90)
• Efficient Clustering Based On A Unified View Of $K$-means And Ratio-cut (NeurIPS 2020 · similarity 0.90)
• k-variates++: more pluses in the k-means++ (ICML 2016 · similarity 0.90)