Research map / Graph learning / Graph algorithms and clustering
Anchor-Driven Nyström for Deep Graph-Level Clustering
Jiaxin Wang, Wenxuan Tu, Lingren Wang, Jieren Cheng, Yue Yang
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| make Nystrom anchors learnable instead of fixed (ablation) | ANGC · MUTAG | clustering ACC (%): 74.54 -> 85.18 | Improved |
| make Nystrom anchors learnable instead of fixed (ablation) | ANGC · DD | clustering ACC (%): 56.40 -> 75.27 | Improved |
| make Nystrom anchors learnable instead of fixed (ablation) | ANGC · COLLAB | clustering ACC (%): 55.42 -> 64.21 | Improved |
| make Nystrom anchors learnable instead of fixed (ablation) | ANGC · NCI1 | clustering ACC (%): 53.39 -> 61.48 | Improved |
| add anchor response discrepancy regularization (ablation) | ANGC · MUTAG | clustering ACC (%): 81.53 -> 85.18 | Improved |
| add anchor response discrepancy regularization (ablation) | ANGC · COLLAB | clustering ACC (%): 58.86 -> 64.21 | Improved |
| add anchor response discrepancy regularization (ablation) | ANGC · PTC-MR | clustering ACC (%): 56.81 -> 58.26 | Improved |
| add anchor response discrepancy regularization (ablation) | ANGC · PTC-MR | NMI (%): 2.73 -> 2.65 | No clear effect |
| use ANGC instead of best baseline GNN/kernel clustering | ANGC · PTC-MR | clustering ACC (%): 59.98 -> 58.26 | Hurt |
| use ANGC instead of GPC/DCGLC | ANGC · DD | clustering ACC (%): 69.52 -> 75.27 | Improved |
| use ANGC kernel anchors vs DCGLC (runtime) | ANGC · REDDIT-M-12K | one-epoch runtime (s): 1069.05 -> 559.14 | Improved |
| use ANGC kernel anchors vs GraphCL (runtime) | ANGC · MUTAG | one-epoch runtime (s): 3.14 -> 4.27 | Hurt |
Earlier methods this paper compares with
Named baselines from earlier accepted papers in this paper's results tables: better than 1 of 1 on most shared results.
- GLCC — GLCC: A General Framework for Graph-Level Clustering (AAAI 2023) · better on 1 of 1 shared result
Matched by method name in results tables read by AI. Authors' own tables tend to favour the newer method, and a comparison can be missed when a method is renamed.
Closest papers by meaning
- Towards Learnable Anchor for Deep Multi-View Clustering (AAAI 2025 · similarity 0.90)
- Non-Graph Data Clustering via $\mathcal {O}(n)$ Bipartite Graph Convolution (TPAMI 2022 · similarity 0.90)
- DGCBench: A Deep Graph Clustering Benchmark (NeurIPS 2025 · similarity 0.89)
- DGCLUSTER: A Neural Framework for Attributed Graph Clustering via Modularity Maximization (AAAI 2024 · similarity 0.88)
- THESAURUS: Contrastive Graph Clustering by Swapping Fused Gromov-Wasserstein Couplings (AAAI 2025 · similarity 0.87)
- Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation (ICML 2025 · similarity 0.87)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
