Hua Duan, Shiduo Wang, Yufei Zhao, Hua Liu, Xiaotong Li
{"title":"一种双方型多关系异构图的关系分类和聚合算法","authors":"Hua Duan, Shiduo Wang, Yufei Zhao, Hua Liu, Xiaotong Li","doi":"10.1016/j.ins.2025.122687","DOIUrl":null,"url":null,"abstract":"<div><div>Existing Heterogeneous Graph Neural Networks (HGNNs) are multi-oriented and single-relational heterogeneous graphs, and cannot effectively function on Bipartite-type Multi-relational Heterogeneous Graphs (BMHGs) with multiple relationships. At the same time, existing meta-path-based HGNNs cannot fully consider the differences between meta-paths during the aggregation process, and this difference is even more prominent in BMHGs. The main manifestation is that the number of neighbor nodes connected by various meta-relation paths differs significantly, causing some paths to carry too much noise information, which affects the algorithm performance. In order to solve the problem of the complex relationships in BMHG and the significant disparity in the number of neighbors between paths, this paper proposes a Relation Classification and Aggregation Algorithm for Bipartite-type Multi-Relational Heterogeneous Graphs (RCAA-BMHG). The RCAA-BMHG algorithm consists of three modules: the same-type aggregation module, the across-type aggregation module, and the cross-category feature aggregation layer, which perform differentiated processing of different types of association information between nodes in a Bipartite-type Multi-relational Heterogeneous Graph. Specifically, the same-type aggregation module first introduces a same-type node association filter to distinguish between the densely coupled path and the sparsely coupled path, and then uses a global average strategy and an adaptive weight allocation method to aggregate the information of the two types of coupled paths. The across-type aggregation module is filtered by an across-type node association filter, and then the weighted sum mechanism and the neighborhood feature propagation technology are used to aggregate the information of the two types of coupled paths. Finally, RCAA-BMHG uses a category-level attention mechanism to fuse the semantic and feature information of the same and cross types to generate the final node embedding for downstream tasks. Experimental verification shows that RCAA-BMHG not only performs feature aggregation and classification tasks when processing complex heterogeneous graph data, but also shows significant advantages over existing HGNNs algorithms on multiple evaluation metrics. The complete reproducible code and data have been published at: <span><span>https://github.com/Dylanwsd24/RCAA-BMHG</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":"723 ","pages":"Article 122687"},"PeriodicalIF":6.8000,"publicationDate":"2025-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A relation classification and aggregation algorithm for bipartite-type multi-relational heterogeneous graphs\",\"authors\":\"Hua Duan, Shiduo Wang, Yufei Zhao, Hua Liu, Xiaotong Li\",\"doi\":\"10.1016/j.ins.2025.122687\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Existing Heterogeneous Graph Neural Networks (HGNNs) are multi-oriented and single-relational heterogeneous graphs, and cannot effectively function on Bipartite-type Multi-relational Heterogeneous Graphs (BMHGs) with multiple relationships. At the same time, existing meta-path-based HGNNs cannot fully consider the differences between meta-paths during the aggregation process, and this difference is even more prominent in BMHGs. The main manifestation is that the number of neighbor nodes connected by various meta-relation paths differs significantly, causing some paths to carry too much noise information, which affects the algorithm performance. In order to solve the problem of the complex relationships in BMHG and the significant disparity in the number of neighbors between paths, this paper proposes a Relation Classification and Aggregation Algorithm for Bipartite-type Multi-Relational Heterogeneous Graphs (RCAA-BMHG). The RCAA-BMHG algorithm consists of three modules: the same-type aggregation module, the across-type aggregation module, and the cross-category feature aggregation layer, which perform differentiated processing of different types of association information between nodes in a Bipartite-type Multi-relational Heterogeneous Graph. Specifically, the same-type aggregation module first introduces a same-type node association filter to distinguish between the densely coupled path and the sparsely coupled path, and then uses a global average strategy and an adaptive weight allocation method to aggregate the information of the two types of coupled paths. The across-type aggregation module is filtered by an across-type node association filter, and then the weighted sum mechanism and the neighborhood feature propagation technology are used to aggregate the information of the two types of coupled paths. Finally, RCAA-BMHG uses a category-level attention mechanism to fuse the semantic and feature information of the same and cross types to generate the final node embedding for downstream tasks. Experimental verification shows that RCAA-BMHG not only performs feature aggregation and classification tasks when processing complex heterogeneous graph data, but also shows significant advantages over existing HGNNs algorithms on multiple evaluation metrics. The complete reproducible code and data have been published at: <span><span>https://github.com/Dylanwsd24/RCAA-BMHG</span><svg><path></path></svg></span>.</div></div>\",\"PeriodicalId\":51063,\"journal\":{\"name\":\"Information Sciences\",\"volume\":\"723 \",\"pages\":\"Article 122687\"},\"PeriodicalIF\":6.8000,\"publicationDate\":\"2025-09-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Information Sciences\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0020025525008205\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"0\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0020025525008205","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"0","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
A relation classification and aggregation algorithm for bipartite-type multi-relational heterogeneous graphs
Existing Heterogeneous Graph Neural Networks (HGNNs) are multi-oriented and single-relational heterogeneous graphs, and cannot effectively function on Bipartite-type Multi-relational Heterogeneous Graphs (BMHGs) with multiple relationships. At the same time, existing meta-path-based HGNNs cannot fully consider the differences between meta-paths during the aggregation process, and this difference is even more prominent in BMHGs. The main manifestation is that the number of neighbor nodes connected by various meta-relation paths differs significantly, causing some paths to carry too much noise information, which affects the algorithm performance. In order to solve the problem of the complex relationships in BMHG and the significant disparity in the number of neighbors between paths, this paper proposes a Relation Classification and Aggregation Algorithm for Bipartite-type Multi-Relational Heterogeneous Graphs (RCAA-BMHG). The RCAA-BMHG algorithm consists of three modules: the same-type aggregation module, the across-type aggregation module, and the cross-category feature aggregation layer, which perform differentiated processing of different types of association information between nodes in a Bipartite-type Multi-relational Heterogeneous Graph. Specifically, the same-type aggregation module first introduces a same-type node association filter to distinguish between the densely coupled path and the sparsely coupled path, and then uses a global average strategy and an adaptive weight allocation method to aggregate the information of the two types of coupled paths. The across-type aggregation module is filtered by an across-type node association filter, and then the weighted sum mechanism and the neighborhood feature propagation technology are used to aggregate the information of the two types of coupled paths. Finally, RCAA-BMHG uses a category-level attention mechanism to fuse the semantic and feature information of the same and cross types to generate the final node embedding for downstream tasks. Experimental verification shows that RCAA-BMHG not only performs feature aggregation and classification tasks when processing complex heterogeneous graph data, but also shows significant advantages over existing HGNNs algorithms on multiple evaluation metrics. The complete reproducible code and data have been published at: https://github.com/Dylanwsd24/RCAA-BMHG.
期刊介绍:
Informatics and Computer Science Intelligent Systems Applications is an esteemed international journal that focuses on publishing original and creative research findings in the field of information sciences. We also feature a limited number of timely tutorial and surveying contributions.
Our journal aims to cater to a diverse audience, including researchers, developers, managers, strategic planners, graduate students, and anyone interested in staying up-to-date with cutting-edge research in information science, knowledge engineering, and intelligent systems. While readers are expected to share a common interest in information science, they come from varying backgrounds such as engineering, mathematics, statistics, physics, computer science, cell biology, molecular biology, management science, cognitive science, neurobiology, behavioral sciences, and biochemistry.