Research map / Learning theory and algorithms / Clustering
Robust Bi-stochastic Graph Regularized Matrix Factorization for Data Clustering
Qi Wang, Xiang He, Jiang Xu, 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
- Graph-based Clustering Revisited: A Relaxation of Kernel k-Means Perspective (JMLR 2026 · similarity 0.89)
- Low-Rank Doubly Stochastic Matrix Decomposition for Cluster Analysis (JMLR 2016 · similarity 0.88)
- Subspace Structure-Aware Spectral Clustering for Robust Subspace Clustering (ICCV 2019 · similarity 0.88)
- Statistically Optimal $K$-means Clustering via Nonnegative Low-rank Semidefinite Programming (ICLR 2024 · similarity 0.88)
- Fine-Grained Bipartite Concept Factorization for Clustering (CVPR 2024 · similarity 0.87)
- A Near-Linear Time Approximation Algorithm for Beyond-Worst-Case Graph Clustering (ICML 2024 · similarity 0.86)
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.
