一种增强异构图学习中节点表示的粒度方法

IF 6.2 2区 计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS
Ying Sun , Hongjiang Ye , Feiyi Xu , Zhenjiang Dong , Yanfei Sun , Jin Qi
{"title":"一种增强异构图学习中节点表示的粒度方法","authors":"Ying Sun ,&nbsp;Hongjiang Ye ,&nbsp;Feiyi Xu ,&nbsp;Zhenjiang Dong ,&nbsp;Yanfei Sun ,&nbsp;Jin Qi","doi":"10.1016/j.future.2025.108080","DOIUrl":null,"url":null,"abstract":"<div><div>Heterogeneous graph learning aims to generate meaningful node representations for graph-structured data with diverse node types and complex relations, facilitating downstream tasks such as node classification and clustering. However, existing methods often emphasize either coarse-grained relational structures or fine-grained node attributes, paying limited attention to the other, which constrains their ability to fully capture the intricate interplay between nodes and relations. To address this limitation, we propose a novel Granular Interaction Heterogeneous Graph Auto-Encoder (GIHGAE), which effectively balances granular fusion and interactions in heterogeneous graph learning. Specifically, GIHGAE employs a relation-level encoder as the primary structure extractor to capture coarse-grained relational dependencies across the graph. Complementarily, we design a node-level encoder that integrates fine-grained contextual details from diverse node attributes, refining representations. These multi-granular features are fused into holistic node embeddings. Additionally, to ensure seamless integration of fine-grained and coarse-grained information, we introduce a global-level decoder to model interactions between nodes and relations explicitly. Finally, to further enhance GIHGAE, we incorporate a dual-loss mechanism, combining reconstruction loss for feature preservation and prediction loss to enhance downstream task performance. Extensive experimental evaluations in heterogeneous graph learning tasks highlight the strong performance of GIHGAE, which consistently outperforms current state-of-the-art methods in classification accuracy, clustering quality, and link prediction performance.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"175 ","pages":"Article 108080"},"PeriodicalIF":6.2000,"publicationDate":"2025-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A granular approach for enhancing node representation in heterogeneous graph learning\",\"authors\":\"Ying Sun ,&nbsp;Hongjiang Ye ,&nbsp;Feiyi Xu ,&nbsp;Zhenjiang Dong ,&nbsp;Yanfei Sun ,&nbsp;Jin Qi\",\"doi\":\"10.1016/j.future.2025.108080\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Heterogeneous graph learning aims to generate meaningful node representations for graph-structured data with diverse node types and complex relations, facilitating downstream tasks such as node classification and clustering. However, existing methods often emphasize either coarse-grained relational structures or fine-grained node attributes, paying limited attention to the other, which constrains their ability to fully capture the intricate interplay between nodes and relations. To address this limitation, we propose a novel Granular Interaction Heterogeneous Graph Auto-Encoder (GIHGAE), which effectively balances granular fusion and interactions in heterogeneous graph learning. Specifically, GIHGAE employs a relation-level encoder as the primary structure extractor to capture coarse-grained relational dependencies across the graph. Complementarily, we design a node-level encoder that integrates fine-grained contextual details from diverse node attributes, refining representations. These multi-granular features are fused into holistic node embeddings. Additionally, to ensure seamless integration of fine-grained and coarse-grained information, we introduce a global-level decoder to model interactions between nodes and relations explicitly. Finally, to further enhance GIHGAE, we incorporate a dual-loss mechanism, combining reconstruction loss for feature preservation and prediction loss to enhance downstream task performance. Extensive experimental evaluations in heterogeneous graph learning tasks highlight the strong performance of GIHGAE, which consistently outperforms current state-of-the-art methods in classification accuracy, clustering quality, and link prediction performance.</div></div>\",\"PeriodicalId\":55132,\"journal\":{\"name\":\"Future Generation Computer Systems-The International Journal of Escience\",\"volume\":\"175 \",\"pages\":\"Article 108080\"},\"PeriodicalIF\":6.2000,\"publicationDate\":\"2025-08-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Future Generation Computer Systems-The International Journal of Escience\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0167739X25003747\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Future Generation Computer Systems-The International Journal of Escience","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167739X25003747","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

异构图学习旨在对节点类型多样、关系复杂的图结构数据生成有意义的节点表示,促进节点分类、聚类等下游任务。然而,现有的方法往往要么强调粗粒度的关系结构,要么强调细粒度的节点属性,对后者的关注有限,这限制了它们充分捕捉节点和关系之间复杂相互作用的能力。为了解决这一限制,我们提出了一种新的颗粒交互异构图自编码器(GIHGAE),它有效地平衡了异构图学习中的颗粒融合和交互。具体来说,GIHGAE使用关系级编码器作为主要结构提取器,以捕获图中的粗粒度关系依赖项。此外,我们还设计了一个节点级编码器,该编码器集成了来自不同节点属性的细粒度上下文细节,从而改进了表示。这些多粒度特征被融合成整体节点嵌入。此外,为了确保细粒度和粗粒度信息的无缝集成,我们引入了全局级解码器来显式地模拟节点和关系之间的交互。最后,为了进一步增强GIHGAE,我们引入了双损失机制,将特征保留的重建损失和预测损失结合起来,以提高下游任务的性能。在异构图学习任务中的大量实验评估突出了GIHGAE的强大性能,它在分类精度、聚类质量和链接预测性能方面始终优于当前最先进的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A granular approach for enhancing node representation in heterogeneous graph learning
Heterogeneous graph learning aims to generate meaningful node representations for graph-structured data with diverse node types and complex relations, facilitating downstream tasks such as node classification and clustering. However, existing methods often emphasize either coarse-grained relational structures or fine-grained node attributes, paying limited attention to the other, which constrains their ability to fully capture the intricate interplay between nodes and relations. To address this limitation, we propose a novel Granular Interaction Heterogeneous Graph Auto-Encoder (GIHGAE), which effectively balances granular fusion and interactions in heterogeneous graph learning. Specifically, GIHGAE employs a relation-level encoder as the primary structure extractor to capture coarse-grained relational dependencies across the graph. Complementarily, we design a node-level encoder that integrates fine-grained contextual details from diverse node attributes, refining representations. These multi-granular features are fused into holistic node embeddings. Additionally, to ensure seamless integration of fine-grained and coarse-grained information, we introduce a global-level decoder to model interactions between nodes and relations explicitly. Finally, to further enhance GIHGAE, we incorporate a dual-loss mechanism, combining reconstruction loss for feature preservation and prediction loss to enhance downstream task performance. Extensive experimental evaluations in heterogeneous graph learning tasks highlight the strong performance of GIHGAE, which consistently outperforms current state-of-the-art methods in classification accuracy, clustering quality, and link prediction performance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
19.90
自引率
2.70%
发文量
376
审稿时长
10.6 months
期刊介绍: Computing infrastructures and systems are constantly evolving, resulting in increasingly complex and collaborative scientific applications. To cope with these advancements, there is a growing need for collaborative tools that can effectively map, control, and execute these applications. Furthermore, with the explosion of Big Data, there is a requirement for innovative methods and infrastructures to collect, analyze, and derive meaningful insights from the vast amount of data generated. This necessitates the integration of computational and storage capabilities, databases, sensors, and human collaboration. Future Generation Computer Systems aims to pioneer advancements in distributed systems, collaborative environments, high-performance computing, and Big Data analytics. It strives to stay at the forefront of developments in grids, clouds, and the Internet of Things (IoT) to effectively address the challenges posed by these wide-area, fully distributed sensing and computing systems.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信