Community Detection
262 papers with code • 14 benchmarks • 13 datasets
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
Benchmarks
These leaderboards are used to track progress in Community Detection
| Trend | Dataset | Best Model | Paper | Code | Compare |
|---|---|---|---|---|---|
|
|||||
|
|||||
|
|||||
|
|||||
|
|||||
|
|||||
|
|||||
|
|||||
|
|||||
|
|||||
|
|||||
|
|||||
|
|||||
|
Libraries
Use these libraries to find Community Detection models and implementations
Pubmed
Cora
SNAP
Placenta
Most implemented papers
Community detection in networks: A user guide
Community detection in networks is one of the most popular topics of modern network science.
Agglomerative Likelihood Clustering
We consider the problem of fast time-series data clustering.
Hidden Community Detection in Social Networks
We introduce a new paradigm that is important for community detection in the realm of network analysis.
Supervised Community Detection with Line Graph Neural Networks
zhengdao-chen/GNN4CD
•
•
ICLR 2019
We show that, in a data-driven manner and without access to the underlying generative models, they can match or even surpass the performance of the belief propagation algorithm on binary and multi-class stochastic block models, which is believed to reach the computational threshold.
Fast Sequence-Based Embedding with Diffusion Graphs
A graph embedding is a representation of graph vertices in a low-dimensional space, which approximately preserves properties such as distances between nodes.
subgraph2vec: Learning Distributed Representations of Rooted Sub-graphs from Large Graphs
mldroid/subgraph2vec_gensim
•
•
Also, we show that the subgraph vectors could be used for building a deep learning variant of Weisfeiler-Lehman graph kernel.
Single Image Reflection Removal through Cascaded Refinement
IBCLN is a cascaded network that iteratively refines the estimates of transmission and reflection layers in a manner that they can boost the prediction quality to each other, and information across steps of the cascade is transferred using an LSTM.
Boosting Multitask Learning on Graphs through Higher-Order Task Affinities
virtuosoresearch/boosting-multitask-learning-on-graphs
•
•
Lastly, we provide a theoretical analysis to show that under a planted block model of tasks on graphs, our affinity scores can provably separate tasks into groups.
Overlapping Community Detection at Scale: A Nonnegative Matrix Factorization Approach
In this paper, we develop a model-based community detection algorithm that can detect densely overlapping, hierarchically nested as well as non-overlapping communities in massive networks.
Font Size: Community Preserving Network Embedding
While previous network embedding methods primarily preserve the microscopic structure, such as the first- and second-order proximities of nodes, the mesoscopic community structure, which is one of the most prominent feature of networks, is largely ignored.
