Research map / Graph learning / Graph algorithms and clustering
FC$^{2}$2: Fast Co-Clustering With Small-Scale Similarity Graph and Bipartite Graph Learning
Xiaowei Zhao, Linrui Xie, Xiaojun Chang, Feiping Nie, Qiang Zhang
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
- Learning A Structured Optimal Bipartite Graph for Co-Clustering (NeurIPS 2017 · similarity 0.92)
- Large-Scale Clustering With Structured Optimal Bipartite Graph (TPAMI 2023 · similarity 0.91)
- Efficient Testing for Correlation Clustering: Improved Algorithms and Optimal Bounds (ICLR 2026 · similarity 0.91)
- Improved Approximation Algorithms for Chromatic and Pseudometric-Weighted Correlation Clustering (NeurIPS 2025 · similarity 0.90)
- Local Graph Clustering with Noisy Labels (ICLR 2024 · similarity 0.89)
- Online Sparsification of Bipartite-Like Clusters in Graphs (ICML 2025 · similarity 0.88)
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.
