Papers › Rethinking Graph Auto-Encoder Models for Attributed Graph Clustering

Rethinking Graph Auto-Encoder Models for Attributed Graph Clustering

19 Jul 2021arXiv:2107.08562archive 2025-07-28

Nairouz Mrabah, Mohamed Bouguessa, Mohamed Fawzi Touati, Riadh Ksantini

Most recent graph clustering methods have resorted to Graph Auto-Encoders (GAEs) to perform joint clustering and embedding learning. However, two critical issues have been overlooked. First, the accumulative error, inflicted by learning with noisy clustering assignments, degrades the effectiveness and robustness of the clustering model. This problem is called Feature Randomness. Second, reconstructing the adjacency matrix sets the model to learn irrelevant similarities for the clustering task. This problem is called Feature Drift. Interestingly, the theoretical relation between the aforementioned problems has not yet been investigated. We study these issues from two aspects: (1) there is a trade-off between Feature Randomness and Feature Drift when clustering and reconstruction are performed at the same level, and (2) the problem of Feature Drift is more pronounced for GAE models, compared with vanilla auto-encoder models, due to the graph convolutional operation and the graph decoding design. Motivated by these findings, we reformulate the GAE-based clustering methodology. Our solution is two-fold. First, we propose a sampling operator Ξ that triggers a protection mechanism against the noisy clustering assignments. Second, we propose an operator Υ that triggers a correction mechanism against Feature Drift by gradually transforming the reconstructed graph into a clustering-oriented one. As principal advantages, our solution grants a considerable improvement in clustering effectiveness and robustness and can be easily tailored to existing GAE models.

PaperPDFCodeCode Syntology ran

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 3 code samples harvested from 1 repository linked to this paper: 3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified. Where Syntology's instrument failed: 1 where the contract check could not run; failures of Syntology's instrument, not of the code.

By repository: official repository: 3 samples from 1 repository, 3 ran (2 with no instrument failure; 1 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written on 2026-09-22 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

nairouz/R-GAE officialmentioned in paperpytorchSyntology: 3 samples, 3 ran (1 instrument-failed) · 0 unverified report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

3 samples harvested: 3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

2ran · honoured contract
1ran; the contract check could not run

Licence: 0 of the 3 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from nairouz/R-GAE. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

nairouz/R-GAE official repository 3 samples, 3 ran (1 instrument-failed) · 0 unverified
generate_unconflicted_data_index R-DGAE/model_citeseer.py ran; the contract check could not run (RAISES) · metamorphic tier: deterministic fingerprinted MIT (permissive) · f0a154bc489cc4ec · report fixture: signature emb:ndarray/2/float, centers_emb:ndarray/2/float, beta1:float/0/float, beta2:float/0/float · returned tuple · level recorded 2026-09-22
q_mat R-DGAE/model_citeseer.py ran · honoured contract fingerprinted MIT (permissive) · ec5655d1b9135cd8 · report fixture: signature X:ndarray/2/float, centers:ndarray/2/float, alpha:float/0/float · returned ndarray · level recorded 2026-09-22
random_uniform_init R-DGAE/model_citeseer.py ran · honoured contract fingerprinted MIT (permissive) · cacfa3eae432e39e · report fixture: signature input_dim:int/0/int, output_dim:int/0/int · returned Parameter · level recorded 2026-09-22

Tasks

ClusteringGraph ClusteringNode Clustering

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Graph Clustering Citeseer R-DGAE ACC 70.5 #1 of 9 Archive leaderboard report
Graph Clustering Citeseer R-DGAE ARI 47.1 #1 of 9 Archive leaderboard report
Graph Clustering Citeseer R-DGAE NMI 45.0 #1 of 9 Archive leaderboard report
Graph Clustering Citeseer R-GMM-VGAE ACC 68.9 #2 of 9 Archive leaderboard report
Graph Clustering Citeseer R-GMM-VGAE ARI 43.9 #2 of 9 Archive leaderboard report
Graph Clustering Citeseer R-GMM-VGAE NMI 42.0 #2 of 9 Archive leaderboard report
Graph Clustering Cora R-GMM-VGAE ACC 76.7 #1 of 9 Archive leaderboard report
Graph Clustering Cora R-GMM-VGAE ARI 57.9 #1 of 9 Archive leaderboard report
Graph Clustering Cora R-GMM-VGAE NMI 57.3 #1 of 9 Archive leaderboard report
Graph Clustering Cora R-DGAE ACC 73.7 #2 of 9 Archive leaderboard report
Graph Clustering Cora R-DGAE ARI 54.1 #2 of 9 Archive leaderboard report
Graph Clustering Cora R-DGAE NMI 56.0 #2 of 9 Archive leaderboard report
Graph Clustering Pubmed R-GMM-VGAE ACC 74.0 #1 of 7 Archive leaderboard report
Graph Clustering Pubmed R-GMM-VGAE ARI 37.9 #1 of 7 Archive leaderboard report
Graph Clustering Pubmed R-GMM-VGAE NMI 33.4 #1 of 7 Archive leaderboard report
Graph Clustering Pubmed R-DGAE ACC 71.4 #4 of 7 Archive leaderboard report
Graph Clustering Pubmed R-DGAE ARI 34.6 #4 of 7 Archive leaderboard report
Graph Clustering Pubmed R-DGAE NMI 34.4 #4 of 7 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

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