一种结合节点影响和新型有偏随机漫步的链路预测算法

Yunfen Luo, Xingkai Li
{"title":"一种结合节点影响和新型有偏随机漫步的链路预测算法","authors":"Yunfen Luo, Xingkai Li","doi":"10.1109/ITME53901.2021.00032","DOIUrl":null,"url":null,"abstract":"Recent years have seen a lot of interest in link prediction. Essentially, it means designing a prediction algorithm that is capable of accurately describing a certain network mechanism in order to get more accurate predictions. In complex network research, it has important applications. The DeepWalk method randomly samples neighbor nodes, and it does not fully consider the node position itself, so insufficient information considered in node sequence sequence sampling When using DeepWalk for link prediction, the node's own influence characteristics are not considered. First of all,we change DeepWalk through biased random walk, learns the vector representation of nodes, and then fuses the influence between node pairs and the similarity between node pairs to raise the accuracy of link prediction. We have experimented the algorithm of this paper on real network data, and from the experimental results, we can see that the algorithm of this paper works better than other link prediction algorithms.","PeriodicalId":6774,"journal":{"name":"2021 11th International Conference on Information Technology in Medicine and Education (ITME)","volume":"8 1","pages":"107-111"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Link Prediction Algorithm Combining Node Influence and New Biased Random Walk\",\"authors\":\"Yunfen Luo, Xingkai Li\",\"doi\":\"10.1109/ITME53901.2021.00032\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recent years have seen a lot of interest in link prediction. Essentially, it means designing a prediction algorithm that is capable of accurately describing a certain network mechanism in order to get more accurate predictions. In complex network research, it has important applications. The DeepWalk method randomly samples neighbor nodes, and it does not fully consider the node position itself, so insufficient information considered in node sequence sequence sampling When using DeepWalk for link prediction, the node's own influence characteristics are not considered. First of all,we change DeepWalk through biased random walk, learns the vector representation of nodes, and then fuses the influence between node pairs and the similarity between node pairs to raise the accuracy of link prediction. We have experimented the algorithm of this paper on real network data, and from the experimental results, we can see that the algorithm of this paper works better than other link prediction algorithms.\",\"PeriodicalId\":6774,\"journal\":{\"name\":\"2021 11th International Conference on Information Technology in Medicine and Education (ITME)\",\"volume\":\"8 1\",\"pages\":\"107-111\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 11th International Conference on Information Technology in Medicine and Education (ITME)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITME53901.2021.00032\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 11th International Conference on Information Technology in Medicine and Education (ITME)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITME53901.2021.00032","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

近年来,人们对链接预测产生了浓厚的兴趣。本质上,它意味着设计一种预测算法,能够准确地描述某种网络机制,从而获得更准确的预测。在复杂网络研究中,它有着重要的应用。DeepWalk方法对相邻节点进行随机采样,没有充分考虑节点本身的位置,因此在节点序列序列采样中考虑的信息不足。在使用DeepWalk进行链路预测时,没有考虑节点自身的影响特征。首先,我们通过有偏随机行走改变DeepWalk,学习节点的向量表示,然后融合节点对之间的影响和节点对之间的相似度来提高链路预测的准确性。我们对本文的算法在真实网络数据上进行了实验,从实验结果可以看出,本文的算法比其他的链路预测算法效果更好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Link Prediction Algorithm Combining Node Influence and New Biased Random Walk
Recent years have seen a lot of interest in link prediction. Essentially, it means designing a prediction algorithm that is capable of accurately describing a certain network mechanism in order to get more accurate predictions. In complex network research, it has important applications. The DeepWalk method randomly samples neighbor nodes, and it does not fully consider the node position itself, so insufficient information considered in node sequence sequence sampling When using DeepWalk for link prediction, the node's own influence characteristics are not considered. First of all,we change DeepWalk through biased random walk, learns the vector representation of nodes, and then fuses the influence between node pairs and the similarity between node pairs to raise the accuracy of link prediction. We have experimented the algorithm of this paper on real network data, and from the experimental results, we can see that the algorithm of this paper works better than other link prediction algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信