Research map / Graph learning / Graph algorithms and clustering
Local Network Community Detection with Continuous Optimization of Conductance and Weighted Kernel K-Means
Twan van Laarhoven, Elena Marchiori
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
- Theoretical Bounds on the Network Community Profile from Low-rank Semi-definite Programming (ICML 2023 · similarity 0.89)
- p-Norm Flow Diffusion for Local Graph Clustering (ICML 2020 · similarity 0.88)
- Community Detection Guarantees using Embeddings Learned by Node2Vec (NeurIPS 2024 · similarity 0.88)
- Scalable and Effective Conductance-Based Graph Clustering (AAAI 2023 · similarity 0.86)
- Incorporating Network Embedding into Markov Random Field for Better Community Detection (AAAI 2019 · similarity 0.86)
- The Map Equation Goes Neural: Mapping Network Flows with Graph Neural Networks (NeurIPS 2024 · similarity 0.84)
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.
