{"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/hegae-ac-heterogeneous-graph-auto-encoder-for","title":"HeGAE-AC: heterogeneous graph auto-encoder for attribute completion","arxiv_id":null,"date":"2024-03-05","proceeding":"Knowledge-Based Systems 2024 3","authors":["Yejia Chen","Ye Liu"],"abstract":"Heterogeneous Graphs (HGs) are widely used to model complex real-world networks that involve multiple types of nodes and relations. Many heterogeneous graph neural networks (HGNNs) based methods have been developed to learn low-dimensional representations for nodes in HGs with the assumption of complete attributes for all nodes. However, in many real applications, the attributes of certain nodes may be completely missing, leading to attribute-missing issues. Existing methods for attribute completion in HGs separate topological embedding learning from attribute completion, which can result in sub-optimal solutions. Moreover, the information of higher-order connected nodes is not fully exploited in the process of attribute completion. To address the issues mentioned above, we integrate topological embedding learning, attribute completion, and heterogeneous graph representation learning into an end-to-end framework called HeGAE-AC. Firstly, we utilize a heterogeneous graph auto-encoder (HeGAE) to incorporate the graph topology structure and attribute information of higher-order connected nodes into low-dimensional embeddings. Then, HeGAE decodes embeddings to generate attributes of all nodes. Finally, an HGNN model is employed to obtain node representations for downstream tasks using the completed HGs. We conduct extensive experiments on four realworld networks, which demonstrate that our approach achieves significant improvements over state-of-the-art methods.","url_abs":"https://www.sciencedirect.com/science/article/pii/S0950705124000716","url_pdf":"https://www.sciencedirect.com/science/article/pii/S0950705124000716","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":"hegae-ac-heterogeneous-graph-auto-encoder-for","repo_url":"https://github.com/ivanrity/HeGAE-AC","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"attribute","task_name":"Attribute"},{"task_slug":"graph-representation-learning","task_name":"Graph Representation Learning"},{"task_slug":"representation-learning","task_name":"Representation Learning"}],"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":"ivanrity/HeGAE-AC","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":"cac53807acc1b6b049bb393b7261fe7b1f984df510435804828a201ba4f10303","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}