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 626650 of 919 papers

TitleStatusHype
Towards Direct Comparison of Community Structures in Social Networks0
Towards Modularity Optimization Using Reinforcement Learning to Community Detection in Dynamic Social Networks0
Trading off Quality for Efficiency of Community Detection: An Inductive Method across Graphs0
Transient crosslinking kinetics optimize gene cluster interactions0
Transition Network Analysis: A Novel Framework for Modeling, Visualizing, and Identifying the Temporal Patterns of Learners and Learning Processes0
Two provably consistent divide and conquer clustering algorithms for large networks0
TxAllo: Dynamic Transaction Allocation in Sharded Blockchain Systems0
Uncertainty in GNN Learning Evaluations: A Comparison Between Measures for Quantifying Randomness in GNN Community Detection0
Uncovering communities of pipelines in the task-fMRI analytical space0
Uncovering the Local Hidden Community Structure in Social Networks0
Uncovering the mesoscale structure of the credit default swap market to improve portfolio risk modelling0
Understanding graph embedding methods and their applications0
Understanding Opinions Towards Climate Change on Social Media0
Understanding the Effect of Knowledge Graph Extraction Error on Downstream Graph Analyses: A Case Study on Affiliation Graphs0
Unified Graph Networks (UGN): A Deep Neural Framework for Solving Graph Problems0
Unifying Structural Proximity and Equivalence for Enhanced Dynamic Network Embedding0
Universality of Computational Lower Bounds for Submatrix Detection0
Universality of the stochastic block model0
Unsupervised Adversarially-Robust Representation Learning on Graphs0
Unsupervised Community Detection with a Potts Model Hamiltonian, an Efficient Algorithmic Solution, and Applications in Digital Pathology0
Unsupervised Graph Attention Autoencoder for Attributed Networks using K-means Loss0
Unsupervised Learning from Noisy Networks with Applications to Hi-C Data0
Using deep learning for community discovery in social networks0
Using network metrics to explore the community structure that underlies movement patterns0
Using RL to Identify Divisive Perspectives Improves LLMs Abilities to Identify Communities on Social Media0
Show:102550
← PrevPage 26 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