SOTAVerified

Community Detection

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

Papers

Showing 501525 of 919 papers

TitleStatusHype
Gossip and Attend: Context-Sensitive Graph Representation LearningCode0
Session-based Suggestion of Topics for Geographic Exploratory Search0
Non-backtracking walks reveal compartments in sparse chromatin interaction networks0
A unified framework for spectral clustering in sparse graphsCode0
Overlapping Community Detection in Weighted Temporal Text Networks0
Merge-split Markov chain Monte Carlo for community detection0
Analysis of ResearchGate, A Community Detection ApproachCode0
Karate Club: An API Oriented Open-source Python Framework for Unsupervised Learning on GraphsCode1
Novel Edge and Density Metrics for Link Cohesion0
Struct-MMSB: Mixed Membership Stochastic Blockmodels with Interpretable Structured Priors0
Parameterized Correlation Clustering in Hypergraphs and Bipartite GraphsCode0
Network Clustering Via Kernel-ARMA Modeling and the Grassmannian The Brain-Network Case0
LoCEC: Local Community-based Edge Classification in Large Online Social Networks0
Community Detection on Mixture Multi-layer Networks via Regularized Tensor Decomposition0
Certified Robustness of Community Detection against Adversarial Structural Perturbation via Randomized Smoothing0
Unsupervised Community Detection with a Potts Model Hamiltonian, an Efficient Algorithmic Solution, and Applications in Digital Pathology0
Simultaneous prediction and community detection for networks with application to neuroimagingCode0
LouvainNE: Hierarchical Louvain Method for High Quality and Scalable Network EmbeddingCode1
Graph Neighborhood Attentive PoolingCode0
Community Detection in Bipartite Networks with Stochastic BlockmodelsCode1
Adversarial Attack on Community Detection by Hiding IndividualsCode1
Graph Generators: State of the Art and Open Challenges0
Fast Sequence-Based Embedding with Diffusion GraphsCode1
Randomized Spectral Clustering in Large-Scale Stochastic Block Models0
Graph Ordering: Towards the Optimal by Learning0
Show:102550
← PrevPage 21 of 37Next →

Benchmark Results

#ModelMetricClaimedVerifiedStatus
1GNNAccuracy-NE2Unverified
2CommunityGANF1-score0.09Unverified
3Ego-SplittingF1-score0.04Unverified
#ModelMetricClaimedVerifiedStatus
1EdMotNMI0.42Unverified
2CDNMFNMI0.4Unverified
#ModelMetricClaimedVerifiedStatus
1CDNMFACC0.48Unverified
#ModelMetricClaimedVerifiedStatus
1CommunityGANF1-Score0.15Unverified
#ModelMetricClaimedVerifiedStatus
1Smooth GEMSEC 2Modularity0.56Unverified
#ModelMetricClaimedVerifiedStatus
1Smooth GEMSEC 2Modularity0.69Unverified
#ModelMetricClaimedVerifiedStatus
1Smooth GEMSEC 2Modularity0.65Unverified
#ModelMetricClaimedVerifiedStatus
1Smooth GEMSEC 2Modularity0.68Unverified
#ModelMetricClaimedVerifiedStatus
1Smooth GEMSEC 2Modularity0.71Unverified
#ModelMetricClaimedVerifiedStatus
1Smooth GEMSEC 2Modularity0.57Unverified
#ModelMetricClaimedVerifiedStatus
1Smooth GEMSEC 2Modularity0.86Unverified
#ModelMetricClaimedVerifiedStatus
1Smooth GEMSEC 2Modularity0.85Unverified
#ModelMetricClaimedVerifiedStatus
1CDNMFACC0.67Unverified