DHONE: Density-based higher-order network embedding

IF 1.5 4区 物理与天体物理 Q3 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Wei Guan, Qing Guan, Yueran Duan
{"title":"DHONE: Density-based higher-order network embedding","authors":"Wei Guan, Qing Guan, Yueran Duan","doi":"10.1142/s012918312450133x","DOIUrl":null,"url":null,"abstract":"<p>Studies have indicated that focusing solely on pairwise interactions between two nodes disregards the associativity among multi-nodes in the network’s local structure. This associativity can be seen as dependencies among nodes, where certain edges’ presence depends on the path leading to it. Examinations on diverse datasets have approved that the variable order of chained dependencies allows for the preservation of structure information, which enables the reconstruction of the original network into a Higher-Order Network (HON) with improved quality of network representation. This paper proposes a Density-based Higher-Order Network Embedding (DHONE) algorithm, which integrates the concept of higher-order density into the network-embedding process in order to classify the contribution of different orders of dependencies. Through the construction of a novel and effective higher-order adjacency matrix, DHONE steadily improves the accuracy of network representation learning. Experimental results demonstrate DHONEs proficiency in improving embedding accuracy and overall algorithm robustness. Furthermore, grounded in the concept of higher-order density proposed herein, numerous dependencies have been discerned within the network generated from trajectories, potentially indicating the role of multi-node structures in networks.</p>","PeriodicalId":50308,"journal":{"name":"International Journal of Modern Physics C","volume":null,"pages":null},"PeriodicalIF":1.5000,"publicationDate":"2024-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Modern Physics C","FirstCategoryId":"101","ListUrlMain":"https://doi.org/10.1142/s012918312450133x","RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Studies have indicated that focusing solely on pairwise interactions between two nodes disregards the associativity among multi-nodes in the network’s local structure. This associativity can be seen as dependencies among nodes, where certain edges’ presence depends on the path leading to it. Examinations on diverse datasets have approved that the variable order of chained dependencies allows for the preservation of structure information, which enables the reconstruction of the original network into a Higher-Order Network (HON) with improved quality of network representation. This paper proposes a Density-based Higher-Order Network Embedding (DHONE) algorithm, which integrates the concept of higher-order density into the network-embedding process in order to classify the contribution of different orders of dependencies. Through the construction of a novel and effective higher-order adjacency matrix, DHONE steadily improves the accuracy of network representation learning. Experimental results demonstrate DHONEs proficiency in improving embedding accuracy and overall algorithm robustness. Furthermore, grounded in the concept of higher-order density proposed herein, numerous dependencies have been discerned within the network generated from trajectories, potentially indicating the role of multi-node structures in networks.

DHONE:基于密度的高阶网络嵌入
研究表明,只关注两个节点之间成对的相互作用会忽略网络局部结构中多个节点之间的关联性。这种关联性可视为节点之间的依赖关系,其中某些边的存在取决于通往该边的路径。对不同数据集的研究表明,链式依赖关系的可变顺序可以保留结构信息,从而将原始网络重构为高阶网络(HON),提高网络表示的质量。本文提出了一种基于密度的高阶网络嵌入(DHONE)算法,该算法将高阶密度的概念融入网络嵌入过程,以对不同阶依赖关系的贡献进行分类。通过构建新颖有效的高阶邻接矩阵,DHONE 稳步提高了网络表征学习的准确性。实验结果表明,DHONE 在提高嵌入精度和整体算法鲁棒性方面表现出色。此外,基于本文提出的高阶密度概念,在由轨迹生成的网络中发现了许多依赖关系,这可能表明了多节点结构在网络中的作用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
International Journal of Modern Physics C
International Journal of Modern Physics C 物理-计算机:跨学科应用
CiteScore
3.00
自引率
15.80%
发文量
158
审稿时长
4 months
期刊介绍: International Journal of Modern Physics C (IJMPC) is a journal dedicated to Computational Physics and aims at publishing both review and research articles on the use of computers to advance knowledge in physical sciences and the use of physical analogies in computation. Topics covered include: algorithms; computational biophysics; computational fluid dynamics; statistical physics; complex systems; computer and information science; condensed matter physics, materials science; socio- and econophysics; data analysis and computation in experimental physics; environmental physics; traffic modelling; physical computation including neural nets, cellular automata and genetic algorithms.
文献相关原料
公司名称 产品信息 采购帮参考价格
×
引用
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学术官方微信