{"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/sr-hgn-semantic-and-relation-aware","title":"SR-HGN: semantic- and relation-aware heterogeneous graph neural network","arxiv_id":null,"date":"2023-08-15","proceeding":"Expert Systems with Applications 2023 8","authors":["Zehong Wang a","B","Donghua Yu a","∗","Qi Li a","Shigen Shen c","Shuang Yao d"],"abstract":"Graph Neural Networks (GNNs) have received considerable attention in recent years due to their unique ability to model both topologies and semantics in the graphs. In this paper, we explore the use of GNNs in learning low-dimensional node representations in Heterogeneous Information Networks (HINs), which retain rich semantic information across multiple types of nodes and relations. Existing methods for HINs generally focus on modeling heterogeneity at either the node level or the relation level, but not both. As a result, these methods often fall short of optimal performance. To address this issue, we propose a novel Semanticand Relation-aware Heterogeneous Graph neural Network, dubbed SR-HGN, which jointly incorporates rich semantics preserved on nodes and relations. Our approach involves projecting the HINs into a low-dimensional vector space through two steps: node-level aggregation and type-level aggregation. The node-level aggregation employs an attention mechanism to create relation vectors by aggregating messages from neighborhoods connected via the same type of relation. The type-level aggregation leverages relation vectors to aggregate node representations. In particular, we introduce semantic-aware attention and relation-aware attention in the type-level aggregation to model the contributions of relation vectors, in order to simultaneously gain knowledge from node semantics and relational information. Unlike other approaches that rely on pre-defined meta-paths, our model can be readily applied to most real-world applications without requiring any domain knowledge. To validate the effectiveness of our proposed approach, we conducted extensive experiments on three public datasets. Experimental results demonstrate that the SR-HGN significantly outperforms state-of-the-art baselines on node classification and node clustering tasks.","url_abs":"https://www.sciencedirect.com/science/article/pii/S0957417423004840","url_pdf":"https://www.sciencedirect.com/science/article/pii/S0957417423004840","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":"sr-hgn-semantic-and-relation-aware","repo_url":"https://github.com/Zehong-Wang/SR-HGN","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"graph-neural-network","task_name":"Graph Neural Network"},{"task_slug":"node-classification","task_name":"Node Classification"},{"task_slug":"node-clustering","task_name":"Node Clustering"},{"task_slug":null,"task_name":"Relation"}],"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":"Zehong-Wang/SR-HGN","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":"3c90be0ff24dec11ee413e2f039163810e64887edd5324e445cc7fc1c048e6f7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}