{"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个真实网络上进行的实验研究验证了本文算法的优越性。
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.