{"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/learning-on-attribute-missing-graphs","title":"Learning on Attribute-Missing Graphs","arxiv_id":"2011.01623","date":"2020-11-03","proceeding":null,"authors":["Xu Chen","Siheng Chen","Jiangchao Yao","Huangjie Zheng","Ya zhang","Ivor W Tsang"],"abstract":"Graphs with complete node attributes have been widely explored recently. While in practice, there is a graph where attributes of only partial nodes could be available and those of the others might be entirely missing. This attribute-missing graph is related to numerous real-world applications and there are limited studies investigating the corresponding learning problems. Existing graph learning methods including the popular GNN cannot provide satisfied learning performance since they are not specified for attribute-missing graphs. Thereby, designing a new GNN for these graphs is a burning issue to the graph learning community. In this paper, we make a shared-latent space assumption on graphs and develop a novel distribution matching based GNN called structure-attribute transformer (SAT) for attribute-missing graphs. SAT leverages structures and attributes in a decoupled scheme and achieves the joint distribution modeling of structures and attributes by distribution matching techniques. It could not only perform the link prediction task but also the newly introduced node attribute completion task. Furthermore, practical measures are introduced to quantify the performance of node attribute completion. Extensive experiments on seven real-world datasets indicate SAT shows better performance than other methods on both link prediction and node attribute completion tasks. Codes and data are available online: https://github.com/xuChenSJTU/SAT-master-online","url_abs":"https://arxiv.org/abs/2011.01623v1","url_pdf":"https://arxiv.org/pdf/2011.01623v1.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":"learning-on-attribute-missing-graphs","repo_url":"https://github.com/xuChenSJTU/SAT-master-online","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"learning-on-attribute-missing-graphs","repo_url":"https://github.com/xuChenSJTU/SAT-master-link-prediction","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"learning-on-attribute-missing-graphs","repo_url":"https://github.com/xuChenSJTU/SAT-master-node-attribute-completion","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"attribute","task_name":"Attribute"},{"task_slug":"graph-learning","task_name":"Graph Learning"},{"task_slug":"link-prediction","task_name":"Link Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2011.01623","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.01623"}},"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/xuChenSJTU/SAT-master-online","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/xuChenSJTU/SAT-master-node-attribute-completion","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/xuChenSJTU/SAT-master-link-prediction","reach":null}],"summary":{"ran_honours":1,"ran_fixture":2,"ran_draft_wrong":2,"unverified":1},"by_repo_kind":{"official":{"samples":3,"ran":3,"repositories":1},"listed":{"samples":3,"ran":2,"repositories":1}},"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":6,"samples":[{"code_sha256_prefix":"22233629324ffe17","entry":"fts_loss_continuous","repo":"xuChenSJTU/SAT-master-online","repo_kind":"official","path":"NANG_main.py","file_url":"https://github.com/xuChenSJTU/SAT-master-online/blob/HEAD/NANG_main.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"22233629324ffe17"}},{"code_sha256_prefix":"c736e22b6c81345d","entry":"fts_loss_discrete","repo":"xuChenSJTU/SAT-master-online","repo_kind":"official","path":"NANG_main.py","file_url":"https://github.com/xuChenSJTU/SAT-master-online/blob/HEAD/NANG_main.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"c736e22b6c81345d"}},{"code_sha256_prefix":"9b9a38db4701e356","entry":"graph_loss_func","repo":"xuChenSJTU/SAT-master-online","repo_kind":"official","path":"NANG_main.py","file_url":"https://github.com/xuChenSJTU/SAT-master-online/blob/HEAD/NANG_main.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"9b9a38db4701e356"}},{"code_sha256_prefix":"38d684548e6488e8","entry":"renormalize_adj","repo":"xuChenSJTU/SAT-master-link-prediction","repo_kind":"listed","path":"data/process.py","file_url":"https://github.com/xuChenSJTU/SAT-master-link-prediction/blob/HEAD/data/process.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"38d684548e6488e8"}},{"code_sha256_prefix":"c1b14a7851940dca","entry":"to_binary_bag_of_words","repo":"xuChenSJTU/SAT-master-link-prediction","repo_kind":"listed","path":"data/process.py","file_url":"https://github.com/xuChenSJTU/SAT-master-link-prediction/blob/HEAD/data/process.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"c1b14a7851940dca"}},{"code_sha256_prefix":"a7bd63e06a7e21d1","entry":"normalize_adj","repo":"xuChenSJTU/SAT-master-link-prediction","repo_kind":"listed","path":"data/process.py","file_url":"https://github.com/xuChenSJTU/SAT-master-link-prediction/blob/HEAD/data/process.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"a7bd63e06a7e21d1"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}