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

TitleStatusHype
Gossip and Attend: Context-Sensitive Graph Representation LearningCode0
Hypergraph Artificial Benchmark for Community Detection (h-ABCD)Code0
Coupled Graphs and Tensor Factorization for Recommender Systems and Community DetectionCode0
On spectral algorithms for community detection in stochastic blockmodel graphs with vertex covariatesCode0
Contextual Stochastic Block Model: Sharp Thresholds and Contiguity0
Content-driven, unsupervised clustering of news articles through multiscale graph partitioning0
Big Networks: A Survey0
ContCommRTD: A Distributed Content-based Misinformation-aware Community Detection System for Real-Time Disaster Reporting0
BigGraphVis: Leveraging Streaming Algorithms and GPU Acceleration for Visualizing Big Graphs0
Analyzing Modularity Maximization in Approximation, Heuristic, and Graph Neural Network Algorithms for Community Detection0
Community detection for weighted bipartite networks0
Exact Recovery of Community Structures Using DeepWalk and Node2vec0
Bias-Corrected Joint Spectral Embedding for Multilayer Networks with Invariant Subspace: Entrywise Eigenvector Perturbation and Inference0
Analysis of spectral clustering algorithms for community detection: the general bipartite setting0
A data-driven rutting depth short-time prediction model with metaheuristic optimization for asphalt pavements based on RIOHTrack0
Consistency of Lloyd's Algorithm Under Perturbations0
Connectivity in Random Annulus Graphs and the Geometric Block Model0
Beyond the network of plants volatile organic compounds0
Connected Subgraph Detection with Mirror Descent on SDPs0
Benchmarking Evolutionary Community Detection Algorithms in Dynamic Networks0
Computational Lower Bounds for Graphon Estimation via Low-degree Polynomials0
Computational Lower Bounds for Community Detection on Random Graphs0
Complex networks based word embeddings0
Comparative Analysis of Community Detection Algorithms on the SNAP Social Circles Dataset0
Bayesian estimation from few samples: community detection and related problems0
Show:102550
← PrevPage 11 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