{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/attributed-graph-clustering-with-dual","title":"Attributed Graph Clustering with Dual Redundancy Reduction","arxiv_id":null,"date":"2022-04-18","proceeding":"Conference 2022 4","authors":["Lei Gong","Sihang Zhou","Wenxuan Tu and Xinwang Liu∗"],"abstract":"Attributed graph clustering is a basic yet essential\r\nmethod for graph data exploration. Recent efforts\r\nover graph contrastive learning have achieved impressive clustering performance. However, we observe that the commonly adopted InfoMax operation tends to capture redundant information, limiting the downstream clustering performance. To\r\nthis 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\r\nspace. Specifcally, for the input space redundancy reduction, we introduce an adversarial learning mechanism to adaptively learn a redundant\r\nedge-dropping matrix to ensure the diversity of the\r\ncompared sample pairs. To reduce the redundancy\r\nin the latent space, we force the correlation matrix of the cross-augmentation sample embedding\r\nto approximate an identity matrix. Consequently,\r\nthe learned network is forced to be robust against\r\nperturbation while discriminative against different samples. Extensive experiments have demonstrated that AGC-DRR outperforms the state-ofthe-art clustering methods on most of our benchmarks. The corresponding code is available at\r\nhttps://github.com/gongleii/AGC-DRR.","url_abs":"https://www.ijcai.org/proceedings/2022/0418.pdf","url_pdf":"https://www.ijcai.org/proceedings/2022/0418.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"attributed-graph-clustering-with-dual","repo_url":"https://github.com/gongleii/AGC-DRR","is_official":0,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"attributed-graph-clustering-with-dual","repo_url":"https://github.com/chengglmotto/AGC-DRR","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"contrastive-learning","task_name":"Contrastive Learning"},{"task_slug":"diversity","task_name":"Diversity"},{"task_slug":"graph-clustering","task_name":"Graph Clustering"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"gongleii/AGC-DRR","kind":"named_in_paper","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"chengglmotto/AGC-DRR","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"43133f6f6f417476584bc6f53ddfc78446405667c3e22023534af14875091086","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}