Robust Attributed Graph Clustering (RAGC)

Updated 14 July 2026

The topic defines robust attributed graph clustering as a method for stable partitioning of noisy and heterogeneous graphs using techniques like modularity reweighting and dual soft assignments.
It leverages contrastive multi-view formulations and hybrid-collaborative augmentations to address issues such as feature randomness and drift.
Scalability is achieved through efficient gradient-based optimization, neighbor sampling, and decomposable loss functions that maintain robustness under noise.

to=functions.shell 天天中彩票人工 _一本道 പുതിഞ്ഞ code {"command":"python - <<'PY'\nimport urllib.parse, urllib.request\nquery='all:\"robust attributed graph clustering\" OR all:\"graph clustering noisy edges\"'\nurl='http://export.arxiv.org/api/query?search_query='+urllib.parse.quote(query)+'&start=0&max_results=10'\nprint(url)\ntry:\n data=urllib.request.urlopen(url,timeout=20).read().decode('utf-8','ignore')\n print(data[:4000])\nexcept Exception as e:\n print('ERR',e)\nPY"}{Jsiiervation to=functions.shell 彩神争霸怎么样্গoutput code {"output":"http://export.arxiv.org/api/query?search_query=all%3A%22robust%20attributed%20graph%20clustering%22%20OR%20all%3A%22graph%20clustering%20noisy%20edges%22&start=0&max_results=10\nERR HTTP Error 403: Forbidden\n"} assistant to=functions.shell კომენტary 天天爱彩票怎么 code {"command":"python - <<'PY'\nimport urllib.parse, urllib.request\nquery='all:\"robust attributed graph clustering\" OR all:\"graph clustering noisy edges\"'\nurl='https://export.arxiv.org/api/query?search_query='+urllib.parse.quote(query)+'&start=0&max_results=10'\nreq=urllib.request.Request(url,headers={'User-Agent':'Mozilla/5.0'})\ntry:\n data=urllib.request.urlopen(req,timeout=20).read().decode('utf-8','ignore')\n print(data[:4000])\nexcept Exception as e:\n print('ERR',e)\nPY"} to=functions.shell 彩神争霸官方ిన code {"command":"python - <<'PY'\nimport urllib.parse, urllib.request, re\nquery='robust attributed graph clustering noisy edges'\nurl='https://arxiv.org/search/?query='+urllib.parse.quote(query)+'&searchtype=all&abstracts=show&order=-announced_date_first&size=10'\nreq=urllib.request.Request(url,headers={'User-Agent':'Mozilla/5.0'})\ntry:\n data=urllib.request.urlopen(req,timeout=20).read().decode('utf-8','ignore')\n print(data[:5000])\nexcept Exception as e:\n print('ERR',e)\nPY"} code to=functions.shell 񹚊pp_output {"output":"<!DOCTYPE html>\n<html lang=\"en\">\n <head>\n <meta charset=\"utf-8\"/>\n<meta name=\"viewport\" content=\"width=device-width, initial-scale=1\"/>\n<link rel=\"apple-touch-icon\" sizes=\"180x180\" href=\"![https://static.arxiv.org/static/base/1.0.0a5/images/icons/apple-touch-icon.png](https://static.arxiv.org/static/base/1.0.0a5/images/icons/apple-touch-icon.png)\">\n<link rel=\"icon\" type=\"image/png\" sizes=\"32x32\" href=\"![https://static.arxiv.org/static/base/1.0.0a5/images/icons/favicon-32x32.png](https://static.arxiv.org/static/base/1.0.0a5/images/icons/favicon-32x32.png)\">\n<link rel=\"icon\" type=\"image/png\" sizes=\"16x16\" href=\"![https://static.arxiv.org/static/base/1.0.0a5/images/icons/favicon-16x16.png](https://static.arxiv.org/static/base/1.0.0a5/images/icons/favicon-16x16.png)\">\n<link rel=\"manifest\" href=\"https://static.arxiv.org/static/base/1.0.0a5/images/icons/site.webmanifest\">\n<link rel=\"mask-icon\" href=\"https://static.arxiv.org/static/base/1.0.0a5/images/icons/safari-pinned-tab.svg\" color=\"#5bbad5\">\n<meta name=\"msapplication-TileColor\" content=\"#da532c\">\n<meta name=\"theme-color\" content=\"#ffffff\">\n<title>Search | arXiv e-print repository</title>\n<link rel=\"stylesheet\" href=\"https://static.arxiv.org/static/base/1.0.0a5/css/arXiv.css?v=20240617\" />\n<link rel=\"stylesheet\" href=\"https://static.arxiv.org/static/search/0.5.7/css/search.css\" />\n<script src=\"https://static.arxiv.org/static/search/0.5.7/js/accordion.js\"></script>\n </head>\n <body class=\"is-signed-out\"\n data-controller=\"cookies\">\n <a class=\"is-sr-only\" href=\"#content\">Skip to main content</a>\n <header>\n <a href=\"https://arxiv.org/\" class=\"logo\"><img src=\"https://static.arxiv.org/static/base/1.0.0a5/images/arxiv-logo-one-color-white.svg\" alt=\"arXiv logo\" width=\"85\"/></a>\n <div class=\"search-block\" role=\"search\">\n <form class=\"search-bar\" method=\"GET\" action=\"https://arxiv.org/search\">\n <div class=\"field is-horizontal\">\n <div class=\"field-label is-normal\">\n <label for=\"query\" class=\"label\">Search...</label>\n </div>\n <div class=\"field-body\">\n <div class=\"field has-addons\">\n <p class=\"control is-expanded has-icons-left\">\n <input class=\"input is-medium\" type=\"text\" name=\"query\" id=\"query\" value=\"robust attributed graph clustering noisy edges\" placeholder=\"Search term...\"/>\n <span class=\"icon is-small is-left\"><img src=\"https://static.arxiv.org/static/base/1.0.0a5/images/icons/search-black.svg\" alt=\"Search\"/></span>\n </p>\n <p class=\"control\">\n <button class=\"button is-medium is-link\">Search</button>\n </p>\n </div>\n </div>\n </div>\n <input type=\"hidden\" name=\"searchtype\" value=\"all\"/>\n <input type=\"hidden\" name=\"abstracts\" value=\"show\"/>\n <input type=\"hidden\" name=\"order\" value=\"-announced_date_first\"/>\n <input type=\"hidden\" name=\"size\" value=\"50\"/>\n </form>\n </div>\n </header>\n <main><div id=\"content\">\n <div class=\"columns is-mobile\">\n <div class=\"column main-container\">\n \n \n \n \n <h1 class=\"title is-clearfix\">\n Search Results\n <span class=\"arxiv-result-count\">Showing 1–10 of 34 results for all: robust attributed graph clustering noisy edges</span>\n </h1>\n <p class=\"is-size-5\">Which authors of this paper are endorsers?</p>\n <ol>\n <li class=\"arxiv-result\">\n <p class=\"title is-5 mathjax\">\n <a href=\"https://arxiv.org/abs/([2510.02731](/papers/2510.02731))\">Hybrid-Collaborative Augmentation and Contrastive Sample Adaptive-Differential Awareness for Robust Attributed Graph Clustering</a>\n </p>\n <p class=\"authors\">Authors:\n \n \n <a href=\"https://arxiv.org/search/?searchtype=author&query=Qin,+"} to=functions.shell 彩神争霸输钱 code {"command":"python - <<'PY'\nimport urllib.parse, urllib.request, re\nfrom bs4 import BeautifulSoup\nquery='robust attributed graph clustering noisy edges'\nurl='https://arxiv.org/search/?query='+urllib.parse.quote(query)+'&searchtype=all&abstracts=show&order=-announced_date_first&size=10'\nreq=urllib.request.Request(url,headers={'User-Agent':'Mozilla/5.0'})\ndata=urllib.request.urlopen(req,timeout=20).read().decode('utf-8','ignore')\nsoup=BeautifulSoup(data,'html.parser')\nfor li in soup.select('li.arxiv-result')[:10]:\n title=li.select_one('p.title').get_text(' ',strip=True)\n link=li.select_one('p.title a')['href']\n m=re.search(r'/abs/(\d+.\d+)',link)\n print(m.group(1) if m else link, '-', title)\nPY"} code to=functions.shell 天天中奖彩票_output {"output":"(Zhao et al., 3 Oct 2025) - Hybrid-Collaborative Augmentation and Contrastive Sample Adaptive-Differential Awareness for Robust Attributed Graph Clustering\n(Li et al., 25 Jul 2025) - GCL-GCN: Graphormer and Contrastive Learning Enhanced Attributed Graph Clustering Network\n(Xiang et al., 2024) - RDSA: A Robust Deep Graph Clustering Framework via Dual Soft Assignment\n(Zhang et al., 27 May 2026) - Robust Contrastive Graph Clustering with Adaptive Local-Global Integration\n(Mrabah et al., 2021) - Rethinking Graph Auto-Encoder Models for Attributed Graph Clustering\n(Jo et al., 2023) - Robust Graph Clustering via Meta Weighting for Noisy Graphs\n(Tang et al., 2023) - A Survey of Deep Graph Clustering: Taxonomy, Challenge, and Application\n(Zong et al., 18 Jun 2025) - Topic Guided Distillation for Category Level Graph Contrastive Clustering\n(Pingzhen et al., 23 Jul 2025) - Heterogeneous Graph Domain Generalization for Graph-level Classification under Distribution Shifts\n(Yven et al., 11 Jun 2025) - Efficient Graph Anomaly Detection for Dynamic Graphs: A Comprehensive Survey\n"} Robust attributed graph clustering (RAGC) denotes the problem of partitioning an attributed graph $G=(V,E,X)$ into clusters that remain meaningful when graph structure or node attributes are noisy, sparse, heterogeneous, or otherwise misaligned with the clustering objective. In current arXiv literature, the problem is addressed through several distinct but related designs: decomposable modularity losses with meta-learned pairwise weights, dual soft assignment frameworks, graph auto-encoder corrections against Feature Randomness and Feature Drift, semantic-topological distance constructions, and contrastive objectives that couple node-level and edge-level augmentations or local and global semantics (Jo et al., 2023, Xiang et al., 2024, Mrabah et al., 2021, Baroni et al., 2017, Zhao et al., 3 Oct 2025, Zhang et al., 27 May 2026, Li et al., 25 Jul 2025).

1. Formal problem setting

A common formalization uses an attributed graph $G=(V,E,X)$ , where $V=\{v_1,\dots,v_N\}$ is the node set, $E\subseteq V\times V$ is the edge set represented by an adjacency matrix $A$ , and $X\in\mathbb{R}^{N\times D}$ is the node-attribute matrix. In deep formulations, the objective is usually to partition the $N$ nodes into $K$ clusters by learning node embeddings or soft assignments and then producing final pseudo-labels or hard labels by $K$ -means or $\arg\max$ over cluster probabilities. The 2025 method explicitly titled "Hybrid-Collaborative Augmentation and Contrastive Sample Adaptive-Differential Awareness for Robust Attributed Graph Clustering" defines additional variables such as node-level embeddings $G=(V,E,X)$ 0, edge-level embeddings $G=(V,E,X)$ 1, pseudo-labels $G=(V,E,X)$ 2, a pseudo-label correlation matrix $G=(V,E,X)$ 3, a high-confidence set $G=(V,E,X)$ 4, and weight-modulation exponents $G=(V,E,X)$ 5 (Zhao et al., 3 Oct 2025).

Another formulation emphasizes heterogeneous attributes directly. "Efficiently Clustering Very Large Attributed Graphs" defines $G=(V,E,X)$ 6, partitions attributes into quantitative and categorical components, and seeks a partition into non-overlapping $G=(V,E,X)$ 7-close clusters under a distance $G=(V,E,X)$ 8. In that setting, a cluster $G=(V,E,X)$ 9 with centroid $V=\{v_1,\dots,v_N\}$ 0 is $V=\{v_1,\dots,v_N\}$ 1-close if $V=\{v_1,\dots,v_N\}$ 2 for all $V=\{v_1,\dots,v_N\}$ 3. Unlike many deep models, SToC does not require the user to guess in advance the number of clusters (Baroni et al., 2017).

Across these formulations, the central technical question is not only whether clusters are structurally coherent or attribute-homogeneous, but whether the learned partition remains stable when the observed graph deviates from an ideal clean graph.

2. Failure modes and robustness criteria

A primary failure mode is structural noise. "Robust Graph Clustering via Meta Weighting for Noisy Graphs" states that the performance of recent GNN-based graph clustering approaches degenerates significantly on graphs with noise edges, and treats spurious edges as a central robustness target. The paper’s motivating observation is that meaningful and less-meaningful node pairs contribute differently to clustering quality, especially when random edges are prevalent in practice (Jo et al., 2023).

A second line of analysis isolates training pathologies in graph auto-encoder clustering. "Rethinking Graph Auto-Encoder Models for Attributed Graph Clustering" defines Feature Randomness as the effect of erroneous pseudo-labels pushing embeddings in wrong directions during clustering optimization, and Feature Drift as the effect of adjacency reconstruction pulling embeddings toward preserving graph variances that are irrelevant or harmful for clustering. The paper gives gradient-alignment criteria $V=\{v_1,\dots,v_N\}$ 4 and $V=\{v_1,\dots,v_N\}$ 5, and shows a trade-off in the classical joint loss

$V=\{v_1,\dots,v_N\}$ 6

where increasing $V=\{v_1,\dots,v_N\}$ 7 strengthens reconstruction and hence more FD, while decreasing $V=\{v_1,\dots,v_N\}$ 8 emphasizes clustering and hence more FR (Mrabah et al., 2021).

Later robust deep clustering papers broaden the notion of robustness. "RDSA: A Robust Deep Graph Clustering Framework via Dual Soft Assignment" states that many denoising graph clustering methods suffer from lower performance, training instability, and challenges in scaling to large datasets compared to non-denoised models, while "Robust Contrastive Graph Clustering with Adaptive Local-Global Integration" identifies difficulty in flexibly capturing high-order local structures and a tendency to overlook global semantics in complex graphs, especially for fragmented structures and ambiguous cluster boundaries (Xiang et al., 2024, Zhang et al., 27 May 2026).

Contrastive attributed graph clustering papers add further failure modes. The 2025 RAGC model argues that many CAGC methods rely on edges only as auxiliary information for node-level embedding learning, overlook edge-level embedding augmentation and cross-granularity interactions, and treat all contrastive sample pairs equally despite substantial differences between hard and easy positive-negative pairs. GCL-GCN, by contrast, frames the challenge as insufficient capture of local dependencies and complex structures under sparse and heterogeneous graph data (Zhao et al., 3 Oct 2025, Li et al., 25 Jul 2025).

This suggests that “robustness” in RAGC is not restricted to denoising a corrupted adjacency matrix. In the cited literature it also covers optimization stability, representation drift, pairwise weighting, hard-sample awareness, and scalability under large $V=\{v_1,\dots,v_N\}$ 9 and sparse $E\subseteq V\times V$ 0.

3. Objective design: modularity, pairwise weighting, and graph correction

A major route to robustness is to rewrite clustering objectives so that the influence of individual node pairs can be controlled. MetaGC defines a decomposable clustering loss by requiring constants $E\subseteq V\times V$ 1 such that

$E\subseteq V\times V$ 2

and instantiates this with a continuous relaxation of modularity, turned into a loss to be minimized. It then introduces a positive learnable weight $E\subseteq V\times V$ 3 for each node pair and optimizes

$E\subseteq V\times V$ 4

Because the loss is decomposable, MetaGC can adjust influence at the granularity of individual edges; because the relaxation is expectation-conforming, the paper states that global minima over soft assignments recover global minima over hard assignments (Jo et al., 2023).

RDSA also centers modularity, but within a dual-assignment architecture. It constructs the modularity matrix

$E\subseteq V\times V$ 5

defines a structure-based soft assignment $E\subseteq V\times V$ 6, and evaluates modularity by

$E\subseteq V\times V$ 7

To stabilize training and avoid bad local minima, it adds an auxiliary must-link/cannot-link loss on a small set of node pairs, yielding

$E\subseteq V\times V$ 8

RDSA then refines assignments with a second, node-based soft assignment built from $E\subseteq V\times V$ 9 landmark nodes and a Student’s $A$ 0-kernel, coupled with a sharpening KL objective $A$ 1 (Xiang et al., 2024).

The graph auto-encoder reformulation of 2021 addresses robustness by modifying both the clustering set and the reconstructed graph. The sampling operator $A$ 2 keeps only reliable nodes satisfying threshold conditions on transformed soft assignments, so the clustering loss is applied only to $A$ 3. The graph-transforming operator $A$ 4 adds centroid-to-node edges and drops inter-cluster edges among reliable nodes, steadily transforming the self-supervision graph toward a cluster-friendly star-structure. The combined objective is

$A$ 5

Within that framework, robustness is cast explicitly as control over the FR/FD trade-off (Mrabah et al., 2021).

A non-neural but still relevant formulation is SToC, which defines a semantic distance $A$ 6, a topological distance $A$ 7 based on $A$ 8-hop neighborhood Jaccard distance, and a combined distance

$A$ 9

Its robustness is tailorable in the sense that users specify semantic and topological attraction ratios $X\in\mathbb{R}^{N\times D}$ 0, from which the method autotunes the threshold $X\in\mathbb{R}^{N\times D}$ 1 and neighborhood radius $X\in\mathbb{R}^{N\times D}$ 2 (Baroni et al., 2017).

4. Contrastive and multi-view formulations

A second major route to robust attributed graph clustering is contrastive learning. The 2025 method explicitly named RAGC combines Hybrid-Collaborative Augmentation (HCA) with Contrastive Sample Adaptive-Differential Awareness (CSADA). HCA performs node-level and edge-level embedding augmentations simultaneously. Node-level views are built from mixed attribute perturbation, multi-order low-pass filtering, and unshared MLPs to produce $X\in\mathbb{R}^{N\times D}$ 3 and $X\in\mathbb{R}^{N\times D}$ 4. Edge-level views are produced by structure encoders on $X\in\mathbb{R}^{N\times D}$ 5, giving $X\in\mathbb{R}^{N\times D}$ 6 and $X\in\mathbb{R}^{N\times D}$ 7. These are fused into a comprehensive contrastive similarity

$X\in\mathbb{R}^{N\times D}$ 8

The same similarity then feeds back into edge augmentation through

$X\in\mathbb{R}^{N\times D}$ 9

closing a loop in which node-level augmentations inform edge-level augmenters. CSADA uses high-confidence pseudo-labels, a confidence factor $N$ 0, a high-confidence subset $N$ 1, and a weight modulation function $N$ 2 to up-weight hard positives and down-weight hard negatives before optimizing the sample-weighted contrastive loss (Zhao et al., 3 Oct 2025).

RCLG adopts a different contrastive decomposition. It builds two views by Gaussian feature noise injection, extracts local signals from multiple propagation depths $N$ 3, and fuses them with attention to obtain local embeddings $N$ 4. It then recomputes semantic prototypes $N$ 5 every $N$ 6 epochs and injects them through prototype-guided attention, producing

$N$ 7

Training uses a hybrid objective consisting of instance-level InfoNCE, structure-aware contrastive loss, and a clustering alignment loss $N$ 8, combined as

$N$ 9

In that formulation, robustness is tied to adaptive fusion of multi-scale local structure and global semantic prototypes (Zhang et al., 27 May 2026).

GCL-GCN places contrastive learning in a pre-training stage and then fuses three representation streams. Its Graphormer module enriches node features with degree, betweenness, and closeness centrality, plus a feature-space Euclidean distance bias in attention. A two-layer GCN contrastive module then learns an enhanced feature matrix $K$ 0 using positive pairs $K$ 1, feature-dropout augmentation, and a hybrid similarity

$K$ 2

The final clustering model fuses AE, GCN, and Graphormer representations with learnable coefficients $K$ 3, and uses Student’s $K$ 4-distribution plus KL minimization for clustering refinement (Li et al., 25 Jul 2025).

These contrastive models enlarge the RAGC design space beyond direct edge denoising. A plausible implication is that robustness can be induced either by changing which graph relations are trusted, or by changing how view agreement, prototype agreement, and hard/easy sample asymmetry are encoded in the training loss.

5. Optimization procedures and scalability

MetaGC uses a bilevel, gradient-based update with three alternating steps: an inner update for tentative GNN parameters $K$ 5, a meta update for the pairwise-weight model parameters $K$ 6 using the unweighted modularity loss on a disjoint mini-batch, and an outer update for the final GNN step with updated weights. The training loop samples two disjoint mini-batches $K$ 7 and $K$ 8, recalculates $K$ 9, and returns final hard clustering by $K$ 0. Its stated limitation is the $K$ 1 pairwise weight matrix, which may be heavy on very large graphs of approximately $K$ 2 nodes (Jo et al., 2023).

RDSA optimizes the AE encoder/decoder, GCN weights, and even landmark locations jointly via stochastic gradient descent with Adam. In practice it alternates every few epochs between recomputing the structure-based assignment $K$ 3 and modularity matrix $K$ 4, re-selecting landmarks $K$ 5, and updating network weights to reduce

$K$ 6

For scalability, it uses mini-batch training with GraphSAGE-style neighbor sampling, stores sparse adjacency in $K$ 7 space, uses $K$ 8 for the feature matrix and $K$ 9 for a batch modularity submatrix, and reports that it scales to graphs with $\arg\max$ 0 M nodes and $\arg\max$ 1 M edges (Xiang et al., 2024).

The 2021 GAE reformulation keeps per-epoch complexity roughly linear in graph size: encoder and decoder cost $\arg\max$ 2, $\arg\max$ 3 updates cost $\arg\max$ 4 every $\arg\max$ 5 steps, and $\arg\max$ 6 updates cost $\arg\max$ 7 every $\arg\max$ 8 steps. The paper states that this scales to $\arg\max$ 9 with sparse GCN and modest $G=(V,E,X)$ 00 (Mrabah et al., 2021).

SToC is explicitly designed for very large graphs. Building bottom- $G=(V,E,X)$ 01 sketches by $G=(V,E,X)$ 02-BFS costs $G=(V,E,X)$ 03, total clustering time is $G=(V,E,X)$ 04, which becomes $G=(V,E,X)$ 05 when $G=(V,E,X)$ 06, and total space is $G=(V,E,X)$ 07. The paper reports seconds on DBLP and minutes on DIRECTORS, with memory below $G=(V,E,X)$ 08 GB even for $G=(V,E,X)$ 09 M nodes (Baroni et al., 2017).

RCLG and GCL-GCN emphasize practical efficiency rather than explicit worst-case graph-clustering bounds. RCLG reports per-epoch training time on the same order of magnitude as most baselines and convergence within approximately $G=(V,E,X)$ 10 epochs with fixed learning rate, while GCL-GCN adopts a staged procedure consisting of AE pre-training, contrastive pre-training, and joint fine-tuning of AE, GCN, Graphormer, and clustering modules (Zhang et al., 27 May 2026, Li et al., 25 Jul 2025).

6. Empirical profile, representative results, and limitations

The empirical literature evaluates robustness under several kinds of perturbation. MetaGC is tested on Cora, Cora-ML, Citeseer, Amazon-Photo, and Pubmed with injected random edges at $G=(V,E,X)$ 11, $G=(V,E,X)$ 12, and $G=(V,E,X)$ 13 of $G=(V,E,X)$ 14, using Pairwise F1, NMI, and Modularity. Averaged over $G=(V,E,X)$ 15 trials, it achieves the best average rank across all five datasets and noise levels with $G=(V,E,X)$ 16, is statistically superior at $G=(V,E,X)$ 17 to all competitors, and keeps F1/NMI high even at $G=(V,E,X)$ 18 noise. Its meta-weighting mechanism yields Precision-Recall AUC of approximately $G=(V,E,X)$ 19– $G=(V,E,X)$ 20 versus $G=(V,E,X)$ 21– $G=(V,E,X)$ 22 random baseline, and HITS@10% real of approximately $G=(V,E,X)$ 23– $G=(V,E,X)$ 24 recall. The ablation study reports that removing meta-weights degrades F1/NMI by $G=(V,E,X)$ 25– $G=(V,E,X)$ 26 (Jo et al., 2023).

RDSA reports results on Cora, Citeseer, PubMed, Amazon, ogbn-arxiv, and ogbn-products. It states that it outperforms eight state-of-the-art baselines by large margins, with examples of ACC gains of $G=(V,E,X)$ 27– $G=(V,E,X)$ 28 percentage points and ARI gains of $G=(V,E,X)$ 29– $G=(V,E,X)$ 30 points. Under injected noise at $G=(V,E,X)$ 31, $G=(V,E,X)$ 32, and $G=(V,E,X)$ 33 random inter-class edges, its accuracy drops by only $G=(V,E,X)$ 34– $G=(V,E,X)$ 35, whereas second-best methods drop by $G=(V,E,X)$ 36– $G=(V,E,X)$ 37, and its training curves are reported to be much smoother with no large oscillations (Xiang et al., 2024).

The 2025 RAGC model evaluates on CORA, CITESEER, AMAP, BAT, EAT, and UAT, using ACC, NMI, ARI, and F1. On CORA, the reported mean $G=(V,E,X)$ 38 std over $G=(V,E,X)$ 39 runs is ACC $G=(V,E,X)$ 40, NMI $G=(V,E,X)$ 41, ARI $G=(V,E,X)$ 42, and F1 $G=(V,E,X)$ 43; the paper identifies HSAN as the best rival with lower values on all four metrics. Averaged across six datasets, the gains over HSAN are $G=(V,E,X)$ 44 ACC, $G=(V,E,X)$ 45 NMI, $G=(V,E,X)$ 46 ARI, and $G=(V,E,X)$ 47 F1. Under Gaussian noise $G=(V,E,X)$ 48 up to $G=(V,E,X)$ 49, the average drop is $G=(V,E,X)$ 50 versus $G=(V,E,X)$ 51– $G=(V,E,X)$ 52 for SCGC, DCRN, and CCGC, and ablation confirms that both HCA and CSADA are essential (Zhao et al., 3 Oct 2025).

The GAE reformulation evaluates on citation networks and air-traffic graphs using ACC, NMI, and ARI. It reports that “R-” versions outperform original models by $G=(V,E,X)$ 53– $G=(V,E,X)$ 54 ACC points on Cora, Citeseer, and Pubmed, that runtime overhead is at most $G=(V,E,X)$ 55 in practice, and that the models degrade gracefully under random edge modification or feature noise while maintaining higher $G=(V,E,X)$ 56 in early training and rising $G=(V,E,X)$ 57 in later training (Mrabah et al., 2021).

SToC evaluates semantic quality with WCSS and topological quality with Newman–Girvan modularity $G=(V,E,X)$ 58, against Inc-C, GBAGC, and ablations. It reports higher $G=(V,E,X)$ 59 and lower WCSS across attraction ratios $G=(V,E,X)$ 60, while also showing a power-law-like size distribution of clusters rather than the giant-cluster collapse observed in competing methods (Baroni et al., 2017).

Recent contrastive baselines extend this picture. RCLG is reported as best or second best on eight datasets, with ACC $G=(V,E,X)$ 61 on AMAP versus second-best $G=(V,E,X)$ 62, and ACC $G=(V,E,X)$ 63 on COCS versus second-best $G=(V,E,X)$ 64; ablations show that removing attention loses $G=(V,E,X)$ 65– $G=(V,E,X)$ 66 ACC on medium graphs and removing the instance contrastive loss can degrade ACC by $G=(V,E,X)$ 67– $G=(V,E,X)$ 68 points on sparse graphs (Zhang et al., 27 May 2026). GCL-GCN reports mean $G=(V,E,X)$ 69 std over $G=(V,E,X)$ 70 runs, and on Cora shows ACC $G=(V,E,X)$ 71, NMI $G=(V,E,X)$ 72, and ARI $G=(V,E,X)$ 73, improving over MBN by $G=(V,E,X)$ 74, $G=(V,E,X)$ 75, and $G=(V,E,X)$ 76 points respectively; its ablations report up to $G=(V,E,X)$ 77– $G=(V,E,X)$ 78 ACC loss without GCN, up to $G=(V,E,X)$ 79– $G=(V,E,X)$ 80 ACC/ARI loss without Graphormer, and up to $G=(V,E,X)$ 81– $G=(V,E,X)$ 82 loss without contrastive learning (Li et al., 25 Jul 2025).

The limitations reported across the literature are correspondingly heterogeneous. MetaGC highlights the $G=(V,E,X)$ 83 cost of pairwise weights and sensitivity to the batch sizes and learning rates $G=(V,E,X)$ 84 (Jo et al., 2023). RDSA notes that future work may replace hard landmark selection with a continuous learned centroid mechanism, extend to hetero-graphs, or transfer learned clusters to link prediction and node classification (Xiang et al., 2024). SToC identifies overlapping communities, dynamic graphs, and the interpretability of attraction ratios $G=(V,E,X)$ 85 as open questions (Baroni et al., 2017). RCLG proposes extending adaptive local-global integration through alternative clustering algorithms and prototype mechanisms, while the 2025 RAGC paper points to the beneficent cycle between augmentation and adaptive weighting as the central empirical mechanism rather than a formal robustness guarantee (Zhang et al., 27 May 2026, Zhao et al., 3 Oct 2025).

Taken together, these works define RAGC as a family of methods rather than a single algorithmic template. The shared objective is stable partitioning of attributed graphs under non-ideal conditions, but the mechanisms vary sharply: pairwise reweighting of decomposable modularity terms, landmark-refined dual assignments, FR/FD control in auto-encoders, distance-based semantic-topological extraction, and contrastive multi-view representation learning with adaptive sample weighting.