{"title":"用于链接预测的异构超图表示学习","authors":"Zijuan Zhao, Kai Yang, Jinli Guo","doi":"10.1140/epjb/s10051-024-00791-4","DOIUrl":null,"url":null,"abstract":"<p>Heterogeneous graph representation learning gains popularity due to its powerful capabilities of feature extraction and numerous related algorithms have emerged for various downstream tasks in graph structural datasets. However, the interactions among nodes for the heterogeneous graphs in the real world often extend beyond individual pairs, excessive attention is payed on isolated pairwise connections. In this paper, we propose a novel framework of Heterogeneous Hypergraph Representation Learning method (HHRL) to capture high-order interactions for learning effective node representations of heterogeneous graphs. The method firstly organizes the heterogeneous connections as different hypergraphs. By modeling the heterogeneous connections, HHRL captures the rich structural and semantic information present in the graphs. Then, the graph neural network (GNN) is applied for each hypergraph to capture the interdependencies between nodes and their associated features. By utilizing GNN, HHRL can effectively learn expressive node representations that encode both the structural and feature information of the network. Finally, we concatenate the vectors from different hypergraphs to obtain the link representations. The experiments are conducted on five real dataset for link prediction and the results demonstrate the well performance of the proposed framework comparing to the existing baselines</p>","PeriodicalId":787,"journal":{"name":"The European Physical Journal B","volume":"97 10","pages":""},"PeriodicalIF":1.6000,"publicationDate":"2024-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Heterogeneous hypergraph representation learning for link prediction\",\"authors\":\"Zijuan Zhao, Kai Yang, Jinli Guo\",\"doi\":\"10.1140/epjb/s10051-024-00791-4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Heterogeneous graph representation learning gains popularity due to its powerful capabilities of feature extraction and numerous related algorithms have emerged for various downstream tasks in graph structural datasets. However, the interactions among nodes for the heterogeneous graphs in the real world often extend beyond individual pairs, excessive attention is payed on isolated pairwise connections. In this paper, we propose a novel framework of Heterogeneous Hypergraph Representation Learning method (HHRL) to capture high-order interactions for learning effective node representations of heterogeneous graphs. The method firstly organizes the heterogeneous connections as different hypergraphs. By modeling the heterogeneous connections, HHRL captures the rich structural and semantic information present in the graphs. Then, the graph neural network (GNN) is applied for each hypergraph to capture the interdependencies between nodes and their associated features. By utilizing GNN, HHRL can effectively learn expressive node representations that encode both the structural and feature information of the network. Finally, we concatenate the vectors from different hypergraphs to obtain the link representations. The experiments are conducted on five real dataset for link prediction and the results demonstrate the well performance of the proposed framework comparing to the existing baselines</p>\",\"PeriodicalId\":787,\"journal\":{\"name\":\"The European Physical Journal B\",\"volume\":\"97 10\",\"pages\":\"\"},\"PeriodicalIF\":1.6000,\"publicationDate\":\"2024-10-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The European Physical Journal B\",\"FirstCategoryId\":\"4\",\"ListUrlMain\":\"https://link.springer.com/article/10.1140/epjb/s10051-024-00791-4\",\"RegionNum\":4,\"RegionCategory\":\"物理与天体物理\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"PHYSICS, CONDENSED MATTER\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The European Physical Journal B","FirstCategoryId":"4","ListUrlMain":"https://link.springer.com/article/10.1140/epjb/s10051-024-00791-4","RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"PHYSICS, CONDENSED MATTER","Score":null,"Total":0}
Heterogeneous hypergraph representation learning for link prediction
Heterogeneous graph representation learning gains popularity due to its powerful capabilities of feature extraction and numerous related algorithms have emerged for various downstream tasks in graph structural datasets. However, the interactions among nodes for the heterogeneous graphs in the real world often extend beyond individual pairs, excessive attention is payed on isolated pairwise connections. In this paper, we propose a novel framework of Heterogeneous Hypergraph Representation Learning method (HHRL) to capture high-order interactions for learning effective node representations of heterogeneous graphs. The method firstly organizes the heterogeneous connections as different hypergraphs. By modeling the heterogeneous connections, HHRL captures the rich structural and semantic information present in the graphs. Then, the graph neural network (GNN) is applied for each hypergraph to capture the interdependencies between nodes and their associated features. By utilizing GNN, HHRL can effectively learn expressive node representations that encode both the structural and feature information of the network. Finally, we concatenate the vectors from different hypergraphs to obtain the link representations. The experiments are conducted on five real dataset for link prediction and the results demonstrate the well performance of the proposed framework comparing to the existing baselines