{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/attributed-graph-clustering-a-deep","title":"Attributed Graph Clustering: A Deep Attentional Embedding Approach","arxiv_id":"1906.06532","date":"2019-06-15","proceeding":null,"authors":["Chun Wang","Shirui Pan","Ruiqi Hu","Guodong Long","Jing Jiang","Chengqi Zhang"],"abstract":"Graph clustering is a fundamental task which discovers communities or groups in networks. Recent studies have mostly focused on developing deep learning approaches to learn a compact graph embedding, upon which classic clustering methods like k-means or spectral clustering algorithms are applied. These two-step frameworks are difficult to manipulate and usually lead to suboptimal performance, mainly because the graph embedding is not goal-directed, i.e., designed for the specific clustering task. In this paper, we propose a goal-directed deep learning approach, Deep Attentional Embedded Graph Clustering (DAEGC for short). Our method focuses on attributed graphs to sufficiently explore the two sides of information in graphs. By employing an attention network to capture the importance of the neighboring nodes to a target node, our DAEGC algorithm encodes the topological structure and node content in a graph to a compact representation, on which an inner product decoder is trained to reconstruct the graph structure. Furthermore, soft labels from the graph embedding itself are generated to supervise a self-training graph clustering process, which iteratively refines the clustering results. The self-training process is jointly learned and optimized with the graph embedding in a unified framework, to mutually benefit both components. Experimental results compared with state-of-the-art algorithms demonstrate the superiority of our method.","url_abs":"https://arxiv.org/abs/1906.06532v1","url_pdf":"https://arxiv.org/pdf/1906.06532v1.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-a-deep","repo_url":"https://github.com/GraphEoM/GSCAN","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"attributed-graph-clustering-a-deep","repo_url":"https://github.com/Tiger101010/DAEGC","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"attributed-graph-clustering-a-deep","repo_url":"https://github.com/kouyongqi/DAEGC","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"GPL-3.0"}}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"decoder","task_name":"Decoder"},{"task_slug":"graph-clustering","task_name":"Graph Clustering"},{"task_slug":"graph-embedding","task_name":"Graph Embedding"},{"task_slug":"node-clustering","task_name":"Node Clustering"}],"methods":[{"method_slug":"spectral-clustering","method_name":"Spectral Clustering"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=1906.06532","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.06532"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/GraphEoM/GSCAN","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/Tiger101010/DAEGC","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/kouyongqi/DAEGC","reach":{"status":"ok","spdx":"GPL-3.0"}}],"summary":{"ran_draft_wrong":1,"ran_honours":1,"unverified":6},"by_repo_kind":{"listed":{"samples":7,"ran":1,"repositories":2}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"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"},"n_pointer_only_for_licence":1,"samples":[{"code_sha256_prefix":"ae488d391f6d24c2","entry":"dot_product_decode","repo":null,"repo_kind":null,"path":null,"file_url":null,"link_basis":"identical_code_first_harvested_elsewhere","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"mcp_get_code":{"code_sha256":"ae488d391f6d24c2"}},{"code_sha256_prefix":"c8b8a6955c6ca85d","entry":"target_distribution","repo":"Tiger101010/DAEGC","repo_kind":"listed","path":"DAEGC/daegc.py","file_url":"https://github.com/Tiger101010/DAEGC/blob/HEAD/DAEGC/daegc.py","link_basis":"plan_row","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"c8b8a6955c6ca85d"}},{"code_sha256_prefix":"be892fda44df7c50","entry":"covert_to_graph","repo":"GraphEoM/GSCAN","repo_kind":"listed","path":"gscan/gnn.py","file_url":"https://github.com/GraphEoM/GSCAN/blob/HEAD/gscan/gnn.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"be892fda44df7c50"}},{"code_sha256_prefix":"95dd16f7e992d4ef","entry":"data_preprocessing","repo":"Tiger101010/DAEGC","repo_kind":"listed","path":"DAEGC/utils.py","file_url":"https://github.com/Tiger101010/DAEGC/blob/HEAD/DAEGC/utils.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"95dd16f7e992d4ef"}},{"code_sha256_prefix":"3105a1506684aeb3","entry":"evl","repo":"GraphEoM/GSCAN","repo_kind":"listed","path":"gscan/evaluation.py","file_url":"https://github.com/GraphEoM/GSCAN/blob/HEAD/gscan/evaluation.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"3105a1506684aeb3"}},{"code_sha256_prefix":"681f6a5cb5d508f9","entry":"f1","repo":"GraphEoM/GSCAN","repo_kind":"listed","path":"gscan/evaluation.py","file_url":"https://github.com/GraphEoM/GSCAN/blob/HEAD/gscan/evaluation.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"681f6a5cb5d508f9"}},{"code_sha256_prefix":"8b4c02cc305198d9","entry":"get_M","repo":"Tiger101010/DAEGC","repo_kind":"listed","path":"DAEGC/utils.py","file_url":"https://github.com/Tiger101010/DAEGC/blob/HEAD/DAEGC/utils.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"8b4c02cc305198d9"}},{"code_sha256_prefix":"849248c0666eb6f8","entry":"get_dataset","repo":"Tiger101010/DAEGC","repo_kind":"listed","path":"DAEGC/utils.py","file_url":"https://github.com/Tiger101010/DAEGC/blob/HEAD/DAEGC/utils.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"849248c0666eb6f8"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}