Research map / Learning theory and algorithms / Clustering
Parameter-Insensitive Min Cut Clustering With Flexible Size Constrains
Feiping Nie, Fangyuan Xie, Weizhong Yu, Xuelong Li
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
- New l2,1-Norm Relaxation of Multi-Way Graph Cut for Clustering (AAAI 2018 · similarity 0.88)
- A Self-Balanced Min-Cut Algorithm for Image Clustering (ICCV 2017 · similarity 0.87)
- Clustering by Minimum Cut Hyperplanes (TPAMI 2016 · similarity 0.87)
- Partition Level Constrained Clustering (TPAMI 2017 · similarity 0.86)
- Efficient Constrained K-center Clustering with Background Knowledge (AAAI 2024 · similarity 0.85)
- Towards Better-than-2 Approximation for Constrained Correlation Clustering (ICML 2025 · similarity 0.84)
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.
