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

TitleStatusHype
Explaining Interactions Between Text SpansCode0
PRUNE: Preserving Proximity and Global Ranking for Network EmbeddingCode0
Learning dynamic representations of the functional connectome in neurobiological networksCode0
From Node Embedding To Community Embedding : A Hyperbolic ApproachCode0
On Graph Neural Networks versus Graph-Augmented MLPsCode0
Synwalk -- Community Detection via Random Walk ModellingCode0
Communities in the Kuramoto Model: Dynamics and Detection via Path SignaturesCode0
On spectral algorithms for community detection in stochastic blockmodel graphs with vertex covariatesCode0
Semidefinite Programming for Community Detection with Side InformationCode0
Communities in C.elegans connectome through the prism of non-backtracking walksCode0
Qualitative Comparison of Community Detection AlgorithmsCode0
Online Estimation and Community Detection of Network Point Processes for Event StreamsCode0
Faithful Density-Peaks Clustering via Matrix Computations on MPI Parallelization SystemCode0
Learning Persistent Community Structures in Dynamic Networks via Topological Data AnalysisCode0
Fast Network Community Detection with Profile-Pseudo Likelihood MethodsCode0
Perspectives and constraints on neural network models of neurobiological processesCode0
Clubmark: a Parallel Isolation Framework for Benchmarking and Profiling Clustering Algorithms on NUMA ArchitecturesCode0
Clique percolation method: memory efficient almost exact communitiesCode0
Fault Detection Engine in Intelligent Predictive Analytics Platform for DCIMCode0
Learning the Right Layers: a Data-Driven Layer-Aggregation Strategy for Semi-Supervised Learning on Multilayer GraphsCode0
Learning to Identify High Betweenness Centrality Nodes from Scratch: A Novel Graph Neural Network ApproachCode0
Online Tensor Methods for Learning Latent Variable ModelsCode0
Leveraging Node Attributes for Incomplete Relational DataCode0
LGDE: Local Graph-based Dictionary ExpansionCode0
On semidefinite relaxations for the block modelCode0
Show:102550
← PrevPage 35 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