Research map / Learning theory and algorithms / Clustering
FINC: An Efficient and Effective Optimization Method for Normalized Cut
Xiaojun Chen, Zhicong Xiao, Feiping Nie, Joshua Zhexue Huang
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
- A Novel Normalized-Cut Solver With Nearest Neighbor Hierarchical Initialization (TPAMI 2023 · similarity 0.90)
- Kernel Normalized Cut: a Theoretical Revisit (ICML 2019 · similarity 0.86)
- Faster Global Minimum Cut with Predictions (ICML 2025 · similarity 0.84)
- Statistically Optimal $K$-means Clustering via Nonnegative Low-rank Semidefinite Programming (ICLR 2024 · similarity 0.83)
- Multidimensional Fractional Programming for Normalized Cuts (NeurIPS 2024 · similarity 0.83)
- Equivalence between Graph Spectral Clustering and Column Subset Selection (Student Abstract) (AAAI 2024 · similarity 0.82)
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.
