Research map / Graph learning / Graph algorithms and clustering
Community Detection Using Restrained Random-walk Similarity
Makoto Okuda, Shin’ichi Satoh, Yoichi Sato, Yutaka Kidawara
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
- Semi-supervised Community Detection via Structural Similarity Metrics (ICLR 2023 · similarity 0.86)
- Community Recovery in the Geometric Block Model (JMLR 2023 · similarity 0.86)
- Random Walk Conformer: Learning Graph Representation from Long and Short Range (AAAI 2023 · similarity 0.86)
- Repelling Random Walks (ICLR 2024 · similarity 0.85)
- Why the Metric Backbone Preserves Community Structure (NeurIPS 2024 · similarity 0.85)
- Optimal Quasi-clique: Hardness, Equivalence with Densest-k-Subgraph, and Quasi-partitioned Community Mining (AAAI 2024 · similarity 0.85)
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.
