Liqing Qiu, Jingcheng Zhou, Caixia Jing, Yuying Liu
{"title":"Heterogeneous Graph Convolutional Network Based on Correlation Matrix","authors":"Liqing Qiu, Jingcheng Zhou, Caixia Jing, Yuying Liu","doi":"10.1016/j.bdr.2023.100379","DOIUrl":null,"url":null,"abstract":"<div><p><span>Heterogeneous graph embedding maps a high-dimension graph that has different sorts of nodes and edges to a low-dimensional space, making it perform well in downstream tasks. The existing models mainly use two approaches to explore and embed heterogeneous graph information. One is to use meta-path to mining heterogeneous information; the other is to use special modules designed by researchers to explore heterogeneous information. These models show excellent performance in heterogeneous graph embedding tasks. However, none of the models considers using the number of meta-path instances between nodes to improve the performance of heterogeneous graph embedding. The paper proposes a </span><em><strong>H</strong>eterogeneous <strong>G</strong>raph <strong>C</strong>onvolutional <strong>N</strong>etwork based on <strong>C</strong>orrelation <strong>M</strong>atrix</em><span> (CMHGCN) to fully use of the number of meta-path instances between nodes to discover interactive information between nodes in heterogeneous graphs. CMHGCN contains two core components: the node-level correlation component and the semantic-level correlation component. The node-level correlation component is able to use the number of meta-path instances between nodes to calculate the correlation between nodes guided by different meta-paths. The semantic-level correlation component can reasonably integrate such information from different meta-paths. On heterogeneous graphs with a large number of meta-path instances, CMHGCN outperforms baselines in node classification and clustering, according to experiments carried out on three benchmark heterogeneous datasets.</span></p></div>","PeriodicalId":56017,"journal":{"name":"Big Data Research","volume":"32 ","pages":"Article 100379"},"PeriodicalIF":3.5000,"publicationDate":"2023-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Big Data Research","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2214579623000126","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
Heterogeneous graph embedding maps a high-dimension graph that has different sorts of nodes and edges to a low-dimensional space, making it perform well in downstream tasks. The existing models mainly use two approaches to explore and embed heterogeneous graph information. One is to use meta-path to mining heterogeneous information; the other is to use special modules designed by researchers to explore heterogeneous information. These models show excellent performance in heterogeneous graph embedding tasks. However, none of the models considers using the number of meta-path instances between nodes to improve the performance of heterogeneous graph embedding. The paper proposes a Heterogeneous Graph Convolutional Network based on Correlation Matrix (CMHGCN) to fully use of the number of meta-path instances between nodes to discover interactive information between nodes in heterogeneous graphs. CMHGCN contains two core components: the node-level correlation component and the semantic-level correlation component. The node-level correlation component is able to use the number of meta-path instances between nodes to calculate the correlation between nodes guided by different meta-paths. The semantic-level correlation component can reasonably integrate such information from different meta-paths. On heterogeneous graphs with a large number of meta-path instances, CMHGCN outperforms baselines in node classification and clustering, according to experiments carried out on three benchmark heterogeneous datasets.
期刊介绍:
The journal aims to promote and communicate advances in big data research by providing a fast and high quality forum for researchers, practitioners and policy makers from the very many different communities working on, and with, this topic.
The journal will accept papers on foundational aspects in dealing with big data, as well as papers on specific Platforms and Technologies used to deal with big data. To promote Data Science and interdisciplinary collaboration between fields, and to showcase the benefits of data driven research, papers demonstrating applications of big data in domains as diverse as Geoscience, Social Web, Finance, e-Commerce, Health Care, Environment and Climate, Physics and Astronomy, Chemistry, life sciences and drug discovery, digital libraries and scientific publications, security and government will also be considered. Occasionally the journal may publish whitepapers on policies, standards and best practices.