基于多属性排序的共同邻居节点局部中心性的链路预测算法

Mingqiang Zhou, Rongcheng Liu, Xin Zhao, Qingsheng Zhu
{"title":"基于多属性排序的共同邻居节点局部中心性的链路预测算法","authors":"Mingqiang Zhou, Rongcheng Liu, Xin Zhao, Qingsheng Zhu","doi":"10.1109/ICCSE.2017.8085544","DOIUrl":null,"url":null,"abstract":"Link prediction has become an important research topic in the field of complex networks. The purpose of link prediction is to find the missing links or predict the emergence of new links that do not present currently in a complex networks. Considering that the local centrality of common neighbor nodes have an important effect on the similarity-based algorithm, but every centrality measure has its own advantage and limitation. We proposed a multi-attribute ranking method based on the Technique for Order Preference by Similarity to Ideal Object (TOPSIS) to evaluate the local centrality of common neighbor nodes comprehensively. In order to make the local centrality indicator based on TOPSIS achieve better results, we also proposed a new weight calculation method for the attributes normalization matrix. Experimental studies on 6 real world networks from disparate fields verified the superiority of the algorithm proposed in this paper.","PeriodicalId":256055,"journal":{"name":"2017 12th International Conference on Computer Science and Education (ICCSE)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Link prediction algorithm based on local centrality of common neighbor nodes using multi-attribute ranking\",\"authors\":\"Mingqiang Zhou, Rongcheng Liu, Xin Zhao, Qingsheng Zhu\",\"doi\":\"10.1109/ICCSE.2017.8085544\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Link prediction has become an important research topic in the field of complex networks. The purpose of link prediction is to find the missing links or predict the emergence of new links that do not present currently in a complex networks. Considering that the local centrality of common neighbor nodes have an important effect on the similarity-based algorithm, but every centrality measure has its own advantage and limitation. We proposed a multi-attribute ranking method based on the Technique for Order Preference by Similarity to Ideal Object (TOPSIS) to evaluate the local centrality of common neighbor nodes comprehensively. In order to make the local centrality indicator based on TOPSIS achieve better results, we also proposed a new weight calculation method for the attributes normalization matrix. Experimental studies on 6 real world networks from disparate fields verified the superiority of the algorithm proposed in this paper.\",\"PeriodicalId\":256055,\"journal\":{\"name\":\"2017 12th International Conference on Computer Science and Education (ICCSE)\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 12th International Conference on Computer Science and Education (ICCSE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCSE.2017.8085544\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 12th International Conference on Computer Science and Education (ICCSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSE.2017.8085544","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

链路预测已成为复杂网络领域的一个重要研究课题。链接预测的目的是发现当前复杂网络中不存在的缺失链接或预测新链接的出现。考虑到共同邻居节点的局部中心性对基于相似度的算法有重要影响,但每种中心性度量都有其自身的优点和局限性。提出了一种基于TOPSIS (Order Preference Technique by Similarity to Ideal Object)的多属性排序方法,以综合评价共同邻居节点的局部中心性。为了使基于TOPSIS的局部中心性指标取得更好的效果,我们还提出了一种新的属性归一化矩阵权值计算方法。在不同领域的6个真实网络上进行的实验研究验证了本文算法的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Link prediction algorithm based on local centrality of common neighbor nodes using multi-attribute ranking
Link prediction has become an important research topic in the field of complex networks. The purpose of link prediction is to find the missing links or predict the emergence of new links that do not present currently in a complex networks. Considering that the local centrality of common neighbor nodes have an important effect on the similarity-based algorithm, but every centrality measure has its own advantage and limitation. We proposed a multi-attribute ranking method based on the Technique for Order Preference by Similarity to Ideal Object (TOPSIS) to evaluate the local centrality of common neighbor nodes comprehensively. In order to make the local centrality indicator based on TOPSIS achieve better results, we also proposed a new weight calculation method for the attributes normalization matrix. Experimental studies on 6 real world networks from disparate fields verified the superiority of the algorithm proposed in this paper.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A unified approach to automate the usage of plagiarism detection tools in programming courses Software verification of Orion cockpit displays Wine quality identification based on data mining research A comparison of inertial-based navigation algorithms for a low-cost indoor mobile robot A HCI design for developing touch-operation-based DGS: What you think is what you get
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1