基于转换策略的超网络表示学习

Y. Zhu, Haixing Zhao, Jianqiang Huang, Xiaoying Wang
{"title":"基于转换策略的超网络表示学习","authors":"Y. Zhu, Haixing Zhao, Jianqiang Huang, Xiaoying Wang","doi":"10.1145/3546000.3546020","DOIUrl":null,"url":null,"abstract":"In real life, there are many cases that cannot be described by the network abstracted as the graph, but can be described perfectly by the hypernetwork abstracted as the hypergraph. Different from the network, the hypernetwork structure is more complex and poses a great challenge to the existing network representation learning methods. Therefore, in order to overcome the challenge of the hypernetwork structure, a hypernetwork representation learning method with the transformation strategy is proposed. Firstly, as three types of transformation strategies from the hypergraph to the graph, line graph, incidence graph and 2-section graph are combined into three types of integral graphs with the hyperedge information, namely incidence graph + 2-section graph, line graph + incidence graph and line graph + incidence graph + 2-section graph. Secondly, a shallow neural network algorithm is trained respectively on five types of networks abstracted as incidence graph, 2-section graph, incidence graph + 2-section graph, line graph + incidence graph and line graph +incidence graph + 2-section graph to obtain node representation vectors. Finally, the evaluation experiment is conducted on four different types of hypernetwork datasets. The experimental results demonstrate that the node classification performance of 2-section graph is better than that of other graphs, and the link prediction performance of incidence graph + 2-section graph is better than that of other graphs.","PeriodicalId":196955,"journal":{"name":"Proceedings of the 6th International Conference on High Performance Compilation, Computing and Communications","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2022-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Hypernetwork Representation Learning With the Transformation Strategy\",\"authors\":\"Y. Zhu, Haixing Zhao, Jianqiang Huang, Xiaoying Wang\",\"doi\":\"10.1145/3546000.3546020\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In real life, there are many cases that cannot be described by the network abstracted as the graph, but can be described perfectly by the hypernetwork abstracted as the hypergraph. Different from the network, the hypernetwork structure is more complex and poses a great challenge to the existing network representation learning methods. Therefore, in order to overcome the challenge of the hypernetwork structure, a hypernetwork representation learning method with the transformation strategy is proposed. Firstly, as three types of transformation strategies from the hypergraph to the graph, line graph, incidence graph and 2-section graph are combined into three types of integral graphs with the hyperedge information, namely incidence graph + 2-section graph, line graph + incidence graph and line graph + incidence graph + 2-section graph. Secondly, a shallow neural network algorithm is trained respectively on five types of networks abstracted as incidence graph, 2-section graph, incidence graph + 2-section graph, line graph + incidence graph and line graph +incidence graph + 2-section graph to obtain node representation vectors. Finally, the evaluation experiment is conducted on four different types of hypernetwork datasets. The experimental results demonstrate that the node classification performance of 2-section graph is better than that of other graphs, and the link prediction performance of incidence graph + 2-section graph is better than that of other graphs.\",\"PeriodicalId\":196955,\"journal\":{\"name\":\"Proceedings of the 6th International Conference on High Performance Compilation, Computing and Communications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-06-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 6th International Conference on High Performance Compilation, Computing and Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3546000.3546020\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 6th International Conference on High Performance Compilation, Computing and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3546000.3546020","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在现实生活中,有很多情况是抽象为图的网络无法描述的,但抽象为超图的超网络却可以完美地描述。与网络不同,超网络结构更加复杂,对现有的网络表示学习方法提出了很大的挑战。因此,为了克服超网络结构的挑战,提出了一种具有转换策略的超网络表示学习方法。首先,将线图、关联图和2段图作为超图到图的三种转换策略,结合超边信息,将关联图+ 2段图、线图+关联图和线图+关联图+ 2段图三种类型的积分图组合起来。其次,分别对抽象为关联图、2段图、关联图+ 2段图、线形图+关联图、线形图+关联图+ 2段图的5种网络进行浅神经网络算法训练,得到节点表示向量;最后,在四种不同类型的超网络数据集上进行了评价实验。实验结果表明,2段图的节点分类性能优于其他图,关联图+ 2段图的链接预测性能优于其他图。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Hypernetwork Representation Learning With the Transformation Strategy
In real life, there are many cases that cannot be described by the network abstracted as the graph, but can be described perfectly by the hypernetwork abstracted as the hypergraph. Different from the network, the hypernetwork structure is more complex and poses a great challenge to the existing network representation learning methods. Therefore, in order to overcome the challenge of the hypernetwork structure, a hypernetwork representation learning method with the transformation strategy is proposed. Firstly, as three types of transformation strategies from the hypergraph to the graph, line graph, incidence graph and 2-section graph are combined into three types of integral graphs with the hyperedge information, namely incidence graph + 2-section graph, line graph + incidence graph and line graph + incidence graph + 2-section graph. Secondly, a shallow neural network algorithm is trained respectively on five types of networks abstracted as incidence graph, 2-section graph, incidence graph + 2-section graph, line graph + incidence graph and line graph +incidence graph + 2-section graph to obtain node representation vectors. Finally, the evaluation experiment is conducted on four different types of hypernetwork datasets. The experimental results demonstrate that the node classification performance of 2-section graph is better than that of other graphs, and the link prediction performance of incidence graph + 2-section graph is better than that of other graphs.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信