Browse State-of-the-Art › Community Detection

Community Detection

263 papers with code · 14 benchmarks · 13 datasets archive 2025-07-28

Graphs

Community Detection is one of the fundamental problems in network analysis, where the goal is to find groups of nodes that are, in some sense, more similar to each other than to the other nodes.

Source: Randomized Spectral Clustering in Large-Scale Stochastic Block Models

Description from the archive archive 2025-07-28.

Benchmarks archive 2025-07-28

14 leaderboard tables shown for this task, 14 with rows (a “benchmark” on this site is a table with at least one row, as on /sota), ordered by row count. “Best model” is the first row in the archive's own order at snapshot; nothing is re-ranked here and metric direction is not recorded in the archive. PwC's Trend sparklines are not in the archive, so that column is omitted. 10 shown of 14 until expanded.

DatasetBest model (first row in archive order)PaperCodeSyntologyCompare
Amazon (3 rows) CommunityGAN CommunityGAN: Community Detection with Generative Adversarial Nets code — Compare
Cora (2 rows) EdMot EdMot: An Edge Enhancement Approach for Motif-aware Community Detection code — Compare
Citeseer (1 row) CDNMF Contrastive Deep Nonnegative Matrix Factorization for Community Detection code — Compare
DBLP (1 row) CommunityGAN CommunityGAN: Community Detection with Generative Adversarial Nets code — Compare
Facebook Artists (1 row) Smooth GEMSEC 2 GEMSEC: Graph Embedding with Self Clustering code — Compare
Facebook Athletes (1 row) Smooth GEMSEC 2 GEMSEC: Graph Embedding with Self Clustering code — Compare
Facebook Celebrities (1 row) Smooth GEMSEC 2 GEMSEC: Graph Embedding with Self Clustering code — Compare
Facebook Companies (1 row) Smooth GEMSEC 2 GEMSEC: Graph Embedding with Self Clustering code — Compare
Facebook Government (1 row) Smooth GEMSEC 2 GEMSEC: Graph Embedding with Self Clustering code — Compare
Facebook Media (1 row) Smooth GEMSEC 2 GEMSEC: Graph Embedding with Self Clustering code — Compare
Facebook Politicians (1 row) Smooth GEMSEC 2 GEMSEC: Graph Embedding with Self Clustering code — Compare
Facebook TV Show (1 row) Smooth GEMSEC 2 GEMSEC: Graph Embedding with Self Clustering code — Compare
Pubmed (1 row) CDNMF Contrastive Deep Nonnegative Matrix Factorization for Community Detection code — Compare
Twitter-HyDrug (1 row) HyGCL-DC Hypergraph Contrastive Learning for Drug Trafficking Community Detection code — Compare

Syntology column: samples harvested from the paper's repositories and executed on synthesized fixtures; “ran” is not a correctness claim and does not order the table. A dash means no Syntology record for that paper, not a recorded non-run. Read from the graph 2026-09-24.

Libraries

Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.

Datasets archive 2025-07-28

13 datasets whose archive record lists this task, ordered by the archive's paper count.

Subtasks archive 2025-07-28

3 subtasks in the archive's task tree.

Most implemented papers archive 2025-07-28

30 shown of 263 papers with code (919 tagged with this task in all), ordered by repositories listed in the archive, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers without a page here are shown as plain text.

Syntology lines on 6 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced. Read from the graph 2026-09-24.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections