Browse State-of-the-Art › Graph Clustering
Graph Clustering
180 papers with code · 10 benchmarks · 19 datasets archive 2025-07-28
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.
Description from the archive archive 2025-07-28.
Benchmarks archive 2025-07-28
10 leaderboard tables shown for this task, 10 with rows (a “benchmark” on this site is a table with at least one row, as on /sota), ordered by row count. “Best model” is the first row in the archive's own order at snapshot; nothing is re-ranked here and metric direction is not recorded in the archive. PwC's Trend sparklines are not in the archive, so that column is omitted.
Syntology 6 newer papers were judged to report on this task's benchmarks so far (Claude Sonnet 4.5, reading their tables: a model's judgement, not a result; 1 placed): Citeseer (4 judged, 0 placed), Cora (6 judged, 1 placed), Pubmed (1 judged, 0 placed). Drawn from 8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read).
Syntology column: samples harvested from the paper's repositories and executed on synthesized fixtures; “ran” is not a correctness claim and does not order the table. Each line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the row's paper, the line starts with that repository's state (“official” is the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from. A dash means no Syntology record for that paper, not a recorded non-run. Each “ran” line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
19 datasets whose archive record lists this task, ordered by the archive's paper count.
Subtasks archive 2025-07-28
1 subtask in the archive's task tree.
Papers archive 2025-07-28
archive papers tagged: 393 · with a code link: 180 · where Syntology ran a sample: 33 (31 with a run with no instrument failure, 2 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (33 of 393 tagged: 31 with a run with no instrument failure, 2 where every run was a failure of Syntology's instrument)
Page 1 of 4: papers 1 to 100 of 393, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.
Papers without a page here are shown as plain text. A Syntology line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code); hover it for the repositories the samples that ran came from. The first sentence of the abstract is shown for the first 30 papers; every abstract is on its paper's page.
-
21 Nov 2016 22 repositories listed Syntology community repositories only · 11 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 3 honoured, 0 violated, 4 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified (of 13 harvested samples) · 4 pointer-only (licence)We introduce the variational graph auto-encoder (VGAE), a framework for unsupervised learning on graph-structured data based on the variational auto-encoder (VAE).
-
20 May 2019 6 repositories listedFurthermore, Cluster-GCN allows us to train much deeper GCN without much time and memory overhead, which leads to improved prediction accuracy---using a 5-layer Cluster-GCN, we achieve state-of-the-art test F1 score 99.
-
30 Jun 2019 4 repositories listed Syntology official (archive's flag): 2 ran · 3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified (of 9 harvested samples) · 1 pointer-only (licence)Spectral clustering (SC) is a popular clustering technique to find strongly connected communities on a graph.
-
13 Feb 2018 4 repositories listedGraph embedding is an effective method to represent graph data in a low dimensional space for graph analytics.
-
15 Jun 2019 3 repositories listed Syntology 7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified (of 8 harvested samples) · 1 pointer-only (licence)Graph clustering is a fundamental task which discovers communities or groups in networks.
-
14 Sep 2018 3 repositories listedWe also illustrate how the ensemble obtained with ECG can be used to quantify the presence of community structure in the graph.
-
5 Jun 2018 3 repositories listedWe present a novel hierarchical graph clustering algorithm inspired by modularity-based clustering techniques.
-
22 Jun 2024 2 repositories listedEmploying graph neural networks (GNNs) to learn cohesive and discriminative node representations for clustering has shown promising results in deep graph clustering.
-
7 Dec 2023 2 repositories listedAs the most typical graph clustering method, spectral clustering is popular and attractive due to the remarkable performance, easy implementation, and strong adaptability.
-
17 Aug 2023 2 repositories listed Syntology official (archive's flag): 5 ran · 5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 1 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified (of 7 harvested samples) · 7 pointer-only (licence)To address these problems, we propose a novel CONtrastiVe Graph ClustEring network with Reliable AugmenTation (CONVERT).
-
13 Aug 2023 2 repositories listedTo enable the deep graph clustering algorithms to work without the guidance of the predefined cluster number, we propose a new deep graph clustering method termed Reinforcement Graph Clustering (RGC).
-
28 May 2023 2 repositories listed Syntology official (archive's flag): 13 ran · 13 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified (of 17 harvested samples) · 2 pointer-only (licence)Subsequently, the clustering distribution is optimized by minimizing the proposed cluster dilation loss and cluster shrink loss in an adversarial manner.
-
18 May 2023 2 repositories listedTo solve the problem, we propose a general framework for deep Temporal Graph Clustering called TGC, which introduces deep clustering techniques to suit the interaction sequence-based batch-processing pattern of temporal…
-
16 Dec 2022 2 repositories listedMoreover, under the guidance of the carefully collected high-confidence clustering information, our proposed weight modulating function will first recognize the positive and negative samples and then dynamically…
-
7 Dec 2022 2 repositories listedDuring the training procedure, we notice the distinct optimization goals for training learnable augmentors and contrastive learning networks.
-
23 Nov 2022 2 repositories listed Syntology official (archive's flag): 14 ran · 14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified (of 15 harvested samples)However, the corresponding survey paper is relatively scarce, and it is imminent to make a summary of this field.
-
28 Sep 2022 2 repositories listedWe present RuDSI, a new benchmark for word sense induction (WSI) in Russian.
-
16 Jun 2022 2 repositories listedHowever, most existing methods 1) do not directly address the clustering task, since the representation learning and clustering process are separated; 2) depend too much on data augmentation, which greatly limits the…
-
18 Apr 2022 2 repositories listedTo this end, we develop a novel method termed attributed graph clustering with dual redundancy reduction (AGC-DRR) to reduce the information redundancy in both input space and latent feature space.
-
1 Jan 2022 2 repositories listedWe introduce an innovative, data-driven topological data analysis (TDA) technique for estimating the state spaces of dynamically changing functional human brain networks at rest.
-
29 Dec 2021 2 repositories listedTo address this issue, we propose a novel self-supervised deep graph clustering method termed Dual Correlation Reduction Network (DCRN) by reducing information correlation in a dual manner.
-
12 Aug 2021 2 repositories listedThe combination of the traditional convolutional network (i. e., an auto-encoder) and the graph convolutional network has attracted much attention in clustering, in which the auto-encoder extracts the node attribute…
-
24 Jan 2021 2 repositories listedMany graph algorithms for this task are based on variants of the stochastic blockmodel, a random graph with flexible cluster structure.
-
21 Jan 2021 2 repositories listed Syntology official (archive's flag): 1 ran · 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified (of 1 harvested sample) · 1 pointer-only (licence)The complexity and streaming nature of social messages make it appealing to address social event detection in an incremental learning setting, where acquiring, preserving, and extending knowledge are major concerns.
-
16 Dec 2020 2 repositories listedWe characterize the optimal decay rate for each cluster and propose a clustering method that achieves almost exact recovery of the true clusters.
-
29 Jun 2020 2 repositories listedWe propose a transductive Laplacian-regularized inference for few-shot tasks.
-
28 Jun 2020 2 repositories listed Syntology official (archive's flag): 3 ran · 5 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 7 unverified (of 12 harvested samples) · 7 pointer-only (licence)Our transductive inference does not re-train the base model, and can be viewed as a graph clustering of the query set, subject to supervision constraints from the support set.
-
18 Jun 2020 2 repositories listedCombinatorial optimization problems are notoriously challenging for neural networks, especially in the absence of labeled instances.
-
20 May 2020 2 repositories listed Syntology community repositories only · 5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified (of 12 harvested samples)Local graph clustering and the closely related seed set expansion problem are primitives on graphs that are central to a wide range of analytic and learning tasks such as local clustering, community detection, nodes…
-
20 Apr 2020 2 repositories listedPossible reasons for this are: the steep learning curve for these algorithms; the lack of efficient and easy to use software; and the lack of detailed numerical experiments on real-world data that demonstrate their…
-
10 Mar 2020 2 repositories listed
-
15 Jan 2020 2 repositories listed
-
19 Mar 2019 2 repositories listed
-
20 Aug 2018 2 repositories listed
-
23 May 2018 2 repositories listed Syntology 3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified (of 3 harvested samples) · 3 pointer-only (licence)
-
18 Jul 2025 1 repository listed
-
20 May 2025 1 repository listed
-
26 Mar 2025 1 repository listed
-
26 Mar 2025 1 repository listed
-
23 Dec 2024 1 repository listed
-
18 Dec 2024 1 repository listed
-
13 Dec 2024 1 repository listed Syntology official (archive's flag): 4 ran · 4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified (of 7 harvested samples) · 7 pointer-only (licence)
-
4 Dec 2024 1 repository listed
-
27 Nov 2024 1 repository listed
-
29 Oct 2024 1 repository listed
-
24 Oct 2024 1 repository listed
-
19 Oct 2024 1 repository listed
-
1 Oct 2024 1 repository listed
-
10 Aug 2024 1 repository listed
-
9 Aug 2024 1 repository listed
-
7 Aug 2024 1 repository listed Syntology official (archive's flag): 1 ran · 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified (of 1 harvested sample) · 1 pointer-only (licence)
-
23 Jul 2024 1 repository listed Syntology official (archive's flag): 15 ran · 15 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 4 honoured, 0 violated, 4 with no contract checked; 7 where Syntology's instrument failed) · 0 unverified (of 15 harvested samples) · 15 pointer-only (licence)
-
12 Jul 2024 1 repository listed
-
11 Jul 2024 1 repository listed
-
2 Jul 2024 1 repository listed Syntology official (archive's flag): 4 ran · 4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified (of 5 harvested samples)
-
20 Jun 2024 1 repository listed
-
26 May 2024 1 repository listed Syntology official (archive's flag): 10 ran · 10 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 2 violated, 2 with no contract checked; 5 where Syntology's instrument failed) · 3 unverified (of 13 harvested samples) · 3 pointer-only (licence)
-
20 May 2024 1 repository listed
-
20 May 2024 1 repository listed
-
24 Apr 2024 1 repository listed
-
17 Apr 2024 1 repository listed
-
28 Mar 2024 1 repository listed
-
16 Feb 2024 1 repository listed
-
13 Feb 2024 1 repository listed
-
23 Jan 2024 1 repository listed
-
12 Jan 2024 1 repository listed Syntology official (archive's flag): 9 ran · 9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified (of 10 harvested samples) · 10 pointer-only (licence)
-
12 Jan 2024 1 repository listed
-
6 Jan 2024 1 repository listed Syntology official: no sample here; runs from other or unrecorded repositories · 5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified (of 8 harvested samples) · 8 pointer-only (licence)
-
5 Jan 2024 1 repository listed
-
28 Dec 2023 1 repository listed
-
20 Dec 2023 1 repository listed
-
3 Nov 2023 1 repository listed
-
1 Nov 2023 1 repository listed Syntology official (archive's flag): 9 ran · 9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified (of 10 harvested samples) · 1 pointer-only (licence)
-
4 Oct 2023 1 repository listed
-
2 Oct 2023 1 repository listed
-
9 Sep 2023 1 repository listed Syntology official (archive's flag): 2 ran · 2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified (of 2 harvested samples) · 2 pointer-only (licence)
-
31 Aug 2023 1 repository listed
-
23 Aug 2023 1 repository listed
-
10 Aug 2023 1 repository listed Syntology official (archive's flag): 8 ran · 8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified (of 10 harvested samples)
-
17 Jul 2023 1 repository listed
-
7 Jul 2023 1 repository listed
-
14 Jun 2023 1 repository listed
-
8 Jun 2023 1 repository listed
-
4 May 2023 1 repository listed
-
29 Apr 2023 1 repository listed
-
12 Apr 2023 1 repository listed
-
11 Apr 2023 1 repository listed
-
5 Apr 2023 1 repository listed
-
25 Feb 2023 1 repository listed
-
25 Feb 2023 1 repository listed
-
24 Feb 2023 1 repository listed
-
22 Feb 2023 1 repository listed
-
22 Feb 2023 1 repository listed
-
22 Feb 2023 1 repository listed
-
1 Feb 2023 1 repository listed
-
28 Jan 2023 1 repository listed
-
3 Jan 2023 1 repository listed Syntology official (archive's flag): 1 ran · 1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result (of 1 harvested sample) · 1 pointer-only (licence)
-
1 Jan 2023 1 repository listed
-
19 Nov 2022 1 repository listed
-
30 Oct 2022 1 repository listed
Syntology lines on 21 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced; each line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections