SOTAVerified

Graph Clustering

Graph Clustering is the process of grouping the nodes of the graph into clusters, taking into account the edge structure of the graph in such a way that there are several edges within each cluster and very few between clusters. Graph Clustering intends to partition the nodes in the graph into disjoint groups.

Source: Clustering for Graph Datasets via Gumbel Softmax

Papers

Showing 301350 of 393 papers

TitleStatusHype
Ensemble Clustering for GraphsCode0
One Node One Model: Featuring the Missing-Half for Graph ClusteringCode0
Graph Max Shift: A Hill-Climbing Method for Graph ClusteringCode0
Efficient Multi-View Graph Clustering with Local and Global Structure PreservationCode0
Graphon based Clustering and Testing of Networks: Algorithms and TheoryCode0
Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation LearningCode0
Symmetric Nonnegative Matrix Factorization for Graph ClusteringCode0
Gromov-Wasserstein Factorization Models for Graph ClusteringCode0
GSCAN: Graph Stability Clustering for Applications With Noise Using Edge-Aware Excess-of-MassCode0
Sentiment-Driven Community Detection in a Network of Perfume PreferencesCode0
Efficient High-Quality Clustering for Large Bipartite GraphsCode0
CGC: Contrastive Graph Clustering for Community Detection and TrackingCode0
End-to-End Supervised Hierarchical Graph Clustering for Speaker DiarizationCode0
Hierarchical Graph Clustering using Node Pair SamplingCode0
Hierarchical Position Embedding of Graphs with Landmarks and Clustering for Link PredictionCode0
AMOS: An Automated Model Order Selection Algorithm for Spectral Graph ClusteringCode0
Hippocluster: an efficient, hippocampus-inspired algorithm for graph clusteringCode0
Efficient block contrastive learning via parameter-free meta-node approximationCode0
Edge-aware Hard Clustering Graph Pooling for Brain ImagingCode0
Taming graph kernels with random featuresCode0
Parallel Graph Partitioning for Complex NetworksCode0
Parameterized Correlation Clustering in Hypergraphs and Bipartite GraphsCode0
Discrete Optimal Graph ClusteringCode0
PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithmsCode0
Phase Transitions and a Model Order Selection Criterion for Spectral Graph ClusteringCode0
Calibrating and Improving Graph Contrastive LearningCode0
DIGRAC: Digraph Clustering Based on Flow ImbalanceCode0
Clustering-based Image-Text Graph Matching for Domain GeneralizationCode0
Incorporating User's Preference into Attributed Graph ClusteringCode0
p-Norm Flow Diffusion for Local Graph ClusteringCode0
Polaratio: A magnitude-contingent monotonic correlation metric and its improvements to scRNA-seq clusteringCode0
Inferring Networks From Random Walk-Based Node SimilaritiesCode0
Approximate spectral clustering with eigenvector selection and self-tuned kCode0
Simultaneous Dimensionality and Complexity Model Selection for Spectral Graph ClusteringCode0
Approximate spectral clustering density-based similarity for noisy datasetsCode0
Improving Social Awareness Through DANTE: A Deep Affinity Network for Clustering Conversational InteractantsCode0
Template-Based Graph ClusteringCode0
Joint Graph Learning and Model Fitting in Laplacian Regularized Stratified ModelsCode0
RDSA: A Robust Deep Graph Clustering Framework via Dual Soft AssignmentCode0
Cross-Camera Data Association via GNN for Supervised Graph ClusteringCode0
Provably Extending PageRank-based Local Clustering Algorithm to Weighted Directed Graphs with Self-Loops and to HypergraphsCode0
The Map Equation Goes Neural: Mapping Network Flows with Graph Neural NetworksCode0
Correlation Clustering with Same-Cluster Queries Bounded by Optimal CostCode0
Correlation Clustering Algorithm for Dynamic Complete Signed Graphs: An Index-based ApproachCode0
Cluster Attack: Query-based Adversarial Attacks on Graphs with Graph-Dependent PriorsCode0
Balancing the Tradeoff Between Clustering Value and InterpretabilityCode0
Latent structure blockmodels for Bayesian spectral graph clusteringCode0
SMARAGD: Learning SMatch for Accurate and Rapid Approximate Graph DistanceCode0
Random projection tree similarity metric for SpectralNetCode0
Learning-based Efficient Graph Similarity Computation via Multi-Scale Convolutional Set MatchingCode0
Show:102550
← PrevPage 7 of 8Next →

Benchmark Results

#ModelMetricClaimedVerifiedStatus
1R-DGAEACC70.5Unverified
2R-GMM-VGAEACC68.9Unverified
3AGCACC67Unverified
4RWR-GAEACC61.6Unverified
5RWR-VGAEACC61.3Unverified
6ARGEACC57.3Unverified
7ARVGEACC54.4Unverified
8GAEACC40.8Unverified
9DAEGC+GSCAN†NMI39.9Unverified
#ModelMetricClaimedVerifiedStatus
1R-GMM-VGAEACC76.7Unverified
2R-DGAEACC73.7Unverified
3AGCACC68.92Unverified
4RWR-VGAEACC68.5Unverified
5RWR-GAEACC66.9Unverified
6ARGEACC64Unverified
7ARVGEACC63.8Unverified
8GAEACC59.6Unverified
9DAEGC+GSCAN†NMI52.4Unverified
#ModelMetricClaimedVerifiedStatus
1R-GMM-VGAEACC74Unverified
2RWR-VGAEACC73.6Unverified
3RWR-GAEACC72.6Unverified
4R-DGAEACC71.4Unverified
5AGCACC69.78Unverified
6VGAEACC65.48Unverified
7DAEGC+GSCAN†NMI31.7Unverified
#ModelMetricClaimedVerifiedStatus
1Polaratio Consensus ClusteringAdjusted Rand Index1Unverified
#ModelMetricClaimedVerifiedStatus
1Polaratio Consensus ClusteringAdjusted Rand Index0.57Unverified
#ModelMetricClaimedVerifiedStatus
1Polaratio Consensus ClusteringAdjusted Rand Index0.46Unverified
#ModelMetricClaimedVerifiedStatus
1Polaratio Consensus ClusteringAdjusted Rand Index0.91Unverified
#ModelMetricClaimedVerifiedStatus
1Polaratio Consensus ClusteringAdjusted Rand Index0.95Unverified
#ModelMetricClaimedVerifiedStatus
1Polaratio Consensus ClusteringAdjusted Rand Index0.81Unverified
#ModelMetricClaimedVerifiedStatus
1Polaratio Consensus ClusteringAdjusted Rand Index0.81Unverified