Research map / Learning theory and algorithms / Clustering
A Novel and Effective Method to Directly Solve Spectral Clustering
Feiping Nie, Chaodie Liu, Rong Wang, 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
- Unified Spectral Clustering With Optimal Graph (AAAI 2018 · similarity 0.93)
- Discrete and Balanced Spectral Clustering With Scalability (TPAMI 2023 · similarity 0.93)
- A Tighter Analysis of Spectral Clustering, and Beyond (ICML 2022 · similarity 0.92)
- Self-Constrained Spectral Clustering (TPAMI 2022 · similarity 0.92)
- Scalable Sequential Spectral Clustering (AAAI 2016 · similarity 0.91)
- Pass-Efficient Algorithms for Graph Spectral Clustering (Student Abstract) (AAAI 2024 · 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.
