Research map / Learning theory and algorithms / Clustering
A Novel Normalized-Cut Solver With Nearest Neighbor Hierarchical Initialization
Feiping Nie, Jitao Lu, Danyang Wu, Rong Wang, Xuelong Li
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| solve N-Cut directly with Fast-CD instead of EVD+KM | EVD+KM · MNIST10 | ACC: 0.6954 -> 0.7766 | Improved |
| solve N-Cut directly with Fast-CD instead of ISR | ISR · MNIST10 | ACC: 0.5768 -> 0.7766 | Improved |
| use Fast-CD instead of EVD+KM | EVD+KM · 8 benchmark datasets | N-Cut objective: 8.5232 -> 8.6528 on MNIST10 | Improved |
| use Fast-CD instead of EVD+KM | EVD+KM · Segment | NMI: 0.5088 -> 0.4875 | Hurt |
| use Fast-CD instead of EVD+KM | EVD+KM · MSRA50 | NMI: 0.6933 -> 0.6734 | Hurt |
| use Fast-CD instead of ISR | ISR · STL-10 | execution time (s): 224.203 -> 0.574 | Improved |
| use Fast-CD instead of EVD+KM | EVD+KM · MNIST10 | execution time (s): 2.702 -> 0.268 | Improved |
| use ISR instead of EVD+KM spectral discretization | EVD+KM · MNIST10 | ACC: 0.6954 -> 0.5768 | Hurt |
| refine EVD+KM labels with Fast-CD (ablation) | EVD+KM · MNIST10 | NMI: 0.6506 -> 0.6784 | Improved |
| refine EVD+KM labels with Fast-CD (ablation) | EVD+KM · GTdb | NMI: 0.7021 -> 0.7004 | Hurt |
| refine EVD+KM labels with Fast-CD (ablation) | EVD+KM · UMist | N-Cut objective: 12.45199326 -> 12.59905529 | Improved |
| compare Fast-CD to SBMC/EBMC graph clustering | Fast-CD · GTdb | NMI: 0.7056 vs 0.7386 | Hurt |
Closest papers by meaning
- Fully Dynamic Coreset Spectral Clustering (ICML 2026 · similarity 0.90)
- FINC: An Efficient and Effective Optimization Method for Normalized Cut (TPAMI 2022 · similarity 0.90)
- Compressive Spectral Clustering (ICML 2016 · similarity 0.89)
- Spectral Modification of Graphs for Improved Spectral Clustering (NeurIPS 2019 · similarity 0.89)
- Equivalence between Graph Spectral Clustering and Column Subset Selection (Student Abstract) (AAAI 2024 · similarity 0.87)
- Structure-Aware Spectral Sparsification via Uniform Edge Sampling (NeurIPS 2025 · similarity 0.87)
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.
