LIHAN: A Lattice-Guided Incomplete Heterogeneous Information Network Embedding Model for Node Classification

IF 4.5 2区 计算机科学 Q1 COMPUTER SCIENCE, CYBERNETICS
Guangxu Mei;Ziyu Guo;Li Pan;Qian Li;Feng Li;Shijun Liu
{"title":"LIHAN: A Lattice-Guided Incomplete Heterogeneous Information Network Embedding Model for Node Classification","authors":"Guangxu Mei;Ziyu Guo;Li Pan;Qian Li;Feng Li;Shijun Liu","doi":"10.1109/TCSS.2024.3405569","DOIUrl":null,"url":null,"abstract":"Real-world heterogeneous information networks (HINs) are modeled as heterogeneous graphs, in which features and structures are often incomplete. Existing models employ manual imputation or dynamic adjustment to populate the incomplete data. However, there are some limitations in incomplete heterogeneous graph representation learning: 1) using populated data may lose content and high-level interaction information of HINs, even lead to negative impacts on the performance of downstream tasks; and 2) existing models fail to utilize the high-order heterogeneous structures in original incomplete network data. To resolve the above issues, in this article, we proposed a lattice-based incomplete heterogeneous structural attention network (LIHAN) for learning incomplete heterogeneous node embeddings. LIHAN first constructs characteristic lattice and structure lattice by mining characteristic sets and structure sets according to the partial order relations in between. Then, an improved lattice-based heterogeneous dual-attention mechanism is used to learn the heterogeneous node representations. Extensive node classification experiments are conducted on five open datasets to verify the superior performance of the proposed LIHAN model over the state-of-the-art models. Experimental results illustrate that LIHAN outperforms other methods on the micro-F1 and macro-F1 in node classification tasks. Moreover, experiments on different levels of lattices and the parameter sensitivity analysis shows the great stability during the process of experiments.","PeriodicalId":13044,"journal":{"name":"IEEE Transactions on Computational Social Systems","volume":"11 6","pages":"7411-7420"},"PeriodicalIF":4.5000,"publicationDate":"2024-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Computational Social Systems","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10572493/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, CYBERNETICS","Score":null,"Total":0}
引用次数: 0

Abstract

Real-world heterogeneous information networks (HINs) are modeled as heterogeneous graphs, in which features and structures are often incomplete. Existing models employ manual imputation or dynamic adjustment to populate the incomplete data. However, there are some limitations in incomplete heterogeneous graph representation learning: 1) using populated data may lose content and high-level interaction information of HINs, even lead to negative impacts on the performance of downstream tasks; and 2) existing models fail to utilize the high-order heterogeneous structures in original incomplete network data. To resolve the above issues, in this article, we proposed a lattice-based incomplete heterogeneous structural attention network (LIHAN) for learning incomplete heterogeneous node embeddings. LIHAN first constructs characteristic lattice and structure lattice by mining characteristic sets and structure sets according to the partial order relations in between. Then, an improved lattice-based heterogeneous dual-attention mechanism is used to learn the heterogeneous node representations. Extensive node classification experiments are conducted on five open datasets to verify the superior performance of the proposed LIHAN model over the state-of-the-art models. Experimental results illustrate that LIHAN outperforms other methods on the micro-F1 and macro-F1 in node classification tasks. Moreover, experiments on different levels of lattices and the parameter sensitivity analysis shows the great stability during the process of experiments.
李晗:一种网格引导的不完全异构信息网络节点分类嵌入模型
现实世界的异构信息网络(HINs)被建模为异构图,其中的特征和结构通常是不完整的。现有的模型采用手动输入或动态调整来填充不完整的数据。然而,不完全异构图表示学习存在一些局限性:1)使用填充数据可能会丢失HINs的内容和高层交互信息,甚至会对下游任务的性能产生负面影响;2)现有模型未能充分利用原始不完整网络数据中的高阶异构结构。为了解决上述问题,本文提出了一种基于网格的不完全异构结构注意网络(LIHAN),用于学习不完全异构节点嵌入。LIHAN首先根据特征集和结构集之间的偏序关系,挖掘特征集和结构集,构造特征格和结构格。然后,采用改进的基于格子的异构双注意机制学习异构节点表示。在五个开放数据集上进行了大量的节点分类实验,以验证所提出的LIHAN模型优于最先进的模型。实验结果表明,LIHAN算法在节点分类任务的微观f1和宏观f1上优于其他方法。此外,在不同层次格上的实验和参数灵敏度分析表明,该方法在实验过程中具有很大的稳定性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Computational Social Systems
IEEE Transactions on Computational Social Systems Social Sciences-Social Sciences (miscellaneous)
CiteScore
10.00
自引率
20.00%
发文量
316
期刊介绍: IEEE Transactions on Computational Social Systems focuses on such topics as modeling, simulation, analysis and understanding of social systems from the quantitative and/or computational perspective. "Systems" include man-man, man-machine and machine-machine organizations and adversarial situations as well as social media structures and their dynamics. More specifically, the proposed transactions publishes articles on modeling the dynamics of social systems, methodologies for incorporating and representing socio-cultural and behavioral aspects in computational modeling, analysis of social system behavior and structure, and paradigms for social systems modeling and simulation. The journal also features articles on social network dynamics, social intelligence and cognition, social systems design and architectures, socio-cultural modeling and representation, and computational behavior modeling, and their applications.
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信