atlas

Research map / Graph learning / Graph algorithms and clustering

Scalable Attributed-Graph Subspace Clustering

AAAI 2023 · Graph learning › Graph algorithms and clustering · approach: Neural and local graph clustering · 20 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (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 changedWhereMeasuredEffect
Use SAGSC instead of GCCAttributed-graph clustering · ACMCA: 91.3 ± 0.0 -> 93.3 ± 0.1Helped
Use SAGSC instead of GCCAttributed-graph clustering · DBLPCA: 91.8 ± 0.0 -> 93.1 ± 0.1Helped
Use SAGSC instead of GCCAttributed-graph clustering · WikiCA: 53.7 ± 1.4 -> 56.0 ± 2.1Helped
Use SAGSC instead of GCCAttributed-graph clustering · Amazon ComputersCA: 67.6 ± 0.0 -> 69.0 ± 1.0Helped
Use SAGSC instead of S²GCAttributed-graph clustering · PubMedCA: 71.0 ± 0.0 -> 71.1 ± 0.0Helped
Use SAGSC instead of S²GCAttributed-graph clustering · OGBN-arXivCA: 41.9 ± 0.3 -> 47.8 ± 1.7Helped
Choose propagation power with the proposed elbow heuristic rather than the best power selected by grid search (ablation)SAGSC · ACMclustering accuracy: 0.23No clear effect

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy