An efficient method for link prediction in weighted multiplex networks.

Q1 Mathematics
Computational Social Networks Pub Date : 2016-01-01 Epub Date: 2016-11-05 DOI:10.1186/s40649-016-0034-y
Shikhar Sharma, Anurag Singh
{"title":"An efficient method for link prediction in weighted multiplex networks.","authors":"Shikhar Sharma,&nbsp;Anurag Singh","doi":"10.1186/s40649-016-0034-y","DOIUrl":null,"url":null,"abstract":"<p><strong>Background: </strong>A great variety of artificial and natural systems can be abstracted into a set of entities interacting with each other. Such abstractions can very well represent the underlying dynamics of the system when modeled as the network of vertices coupled by edges. Prediction of dynamics in these structures based on topological attribute or dependency relations is an important task. Link Prediction in such complex networks is regarded useful in almost all types of networks as it can be used to extract missing information, identify spurious interactions, and evaluate network evolving mechanisms. Various similarity and likelihood-based indices have been employed to infer different topological and relation-based information to form a link prediction algorithm. These algorithms, however, are too specific to the domain and do not encapsulate the generic nature of the real-world information. In most natural and engineered systems, the entities are linked with multiple types of associations and relations which play a factor in the dynamics of the network. It forms multiple subsystems or multiple layers of networked information. These networks are regarded as Multiplex Networks.</p><p><strong>Methods: </strong>This work presents an approach for link prediction in Multiplex networks where the associations are learned from the multiple layers of networks for link prediction purposes. Most of the real-world networks are represented as weighted networks. Weight prediction coupled with Link Prediction can be of great use. Link scores are received using various similarity measures and used to predict weights. This work further proposes and testifies a strategy for weight prediction.</p><p><strong>Results and conclusions: </strong>This work successfully proposes an algorithm for Weight Prediction using Link similarity measures on multiplex networks. The predicted weights show very less deviation from their actual weights. In comparison to other indices, the proposed method has a far low error rate and outperforms them concerning the metric performance NRMSE.</p>","PeriodicalId":52145,"journal":{"name":"Computational Social Networks","volume":"3 1","pages":"7"},"PeriodicalIF":0.0000,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s40649-016-0034-y","citationCount":"16","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computational Social Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1186/s40649-016-0034-y","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2016/11/5 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 16

Abstract

Background: A great variety of artificial and natural systems can be abstracted into a set of entities interacting with each other. Such abstractions can very well represent the underlying dynamics of the system when modeled as the network of vertices coupled by edges. Prediction of dynamics in these structures based on topological attribute or dependency relations is an important task. Link Prediction in such complex networks is regarded useful in almost all types of networks as it can be used to extract missing information, identify spurious interactions, and evaluate network evolving mechanisms. Various similarity and likelihood-based indices have been employed to infer different topological and relation-based information to form a link prediction algorithm. These algorithms, however, are too specific to the domain and do not encapsulate the generic nature of the real-world information. In most natural and engineered systems, the entities are linked with multiple types of associations and relations which play a factor in the dynamics of the network. It forms multiple subsystems or multiple layers of networked information. These networks are regarded as Multiplex Networks.

Methods: This work presents an approach for link prediction in Multiplex networks where the associations are learned from the multiple layers of networks for link prediction purposes. Most of the real-world networks are represented as weighted networks. Weight prediction coupled with Link Prediction can be of great use. Link scores are received using various similarity measures and used to predict weights. This work further proposes and testifies a strategy for weight prediction.

Results and conclusions: This work successfully proposes an algorithm for Weight Prediction using Link similarity measures on multiplex networks. The predicted weights show very less deviation from their actual weights. In comparison to other indices, the proposed method has a far low error rate and outperforms them concerning the metric performance NRMSE.

Abstract Image

Abstract Image

Abstract Image

加权复用网络中一种有效的链路预测方法。
背景:各种各样的人工和自然系统可以抽象成一组相互作用的实体。这样的抽象可以很好地表示系统的潜在动态,当建模为由边耦合的顶点网络时。基于拓扑属性或依赖关系的结构动力学预测是一项重要任务。这种复杂网络中的链路预测在几乎所有类型的网络中都被认为是有用的,因为它可以用来提取缺失信息,识别虚假交互,以及评估网络演化机制。利用各种基于相似度和似然度的指标来推断不同的拓扑信息和基于关系的信息,形成链路预测算法。然而,这些算法过于特定于领域,不能封装现实世界信息的一般性质。在大多数自然和工程系统中,实体与多种类型的关联和关系联系在一起,这些关联和关系在网络的动态中起着重要作用。它形成了多个子系统或多层的网络化信息。这些网络被认为是多路网络。方法:这项工作提出了一种在多路网络中进行链路预测的方法,其中从多层网络中学习链路预测目的的关联。大多数现实世界的网络都被表示为加权网络。权重预测与链接预测相结合会很有用。使用各种相似性度量来接收链接分数,并用于预测权重。本工作进一步提出并验证了一种权重预测策略。结果和结论:这项工作成功地提出了一种在多路网络上使用链路相似性度量进行权重预测的算法。预测的权重与实际权重的偏差非常小。与其他指标相比,该方法的误差率低,在度量性能NRMSE方面优于其他指标。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computational Social Networks
Computational Social Networks Mathematics-Modeling and Simulation
自引率
0.00%
发文量
0
审稿时长
13 weeks
期刊介绍: Computational Social Networks showcases refereed papers dealing with all mathematical, computational and applied aspects of social computing. The objective of this journal is to advance and promote the theoretical foundation, mathematical aspects, and applications of social computing. Submissions are welcome which focus on common principles, algorithms and tools that govern network structures/topologies, network functionalities, security and privacy, network behaviors, information diffusions and influence, social recommendation systems which are applicable to all types of social networks and social media. Topics include (but are not limited to) the following: -Social network design and architecture -Mathematical modeling and analysis -Real-world complex networks -Information retrieval in social contexts, political analysts -Network structure analysis -Network dynamics optimization -Complex network robustness and vulnerability -Information diffusion models and analysis -Security and privacy -Searching in complex networks -Efficient algorithms -Network behaviors -Trust and reputation -Social Influence -Social Recommendation -Social media analysis -Big data analysis on online social networks This journal publishes rigorously refereed papers dealing with all mathematical, computational and applied aspects of social computing. The journal also includes reviews of appropriate books as special issues on hot topics.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信