Research map / Learning theory and algorithms / Clustering
Detecting Meaningful Clusters From High-Dimensional Data: A Strongly Consistent Sparse Center-Based Clustering Approach
Saptarshi Chakraborty, Swagatam Das
Read the paperCheck your idea against 137,217 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
- Simple and Scalable Sparse k-means Clustering via Feature Ranking (NeurIPS 2020 · similarity 0.94)
- Sparse Embedded $k$-Means Clustering (NeurIPS 2017 · similarity 0.91)
- Simple, Scalable and Effective Clustering via One-Dimensional Projections (NeurIPS 2023 · similarity 0.90)
- A Sampling-Based Approach for Efficient Clustering in Large Datasets (CVPR 2022 · similarity 0.90)
- Robust Discriminative Clustering with Sparse Regularizers (JMLR 2017 · similarity 0.90)
- Efficient Clustering Based On A Unified View Of $K$-means And Ratio-cut (NeurIPS 2020 · similarity 0.89)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
