首页> 外文OA文献 >Extending the Adapted PageRank Algorithm Centrality to Multiplex Networks with Data Using the PageRank Two-Layer Approach
【2h】

Extending the Adapted PageRank Algorithm Centrality to Multiplex Networks with Data Using the PageRank Two-Layer Approach

机译:使用PageRank两层方法将适应的PageRank算法中心延伸到多路复用网络

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。
获取外文期刊封面目录资料

摘要

Usually, the nodes’ interactions in many complex networks need a more accurate mapping than simple links. For instance, in social networks, it may be possible to consider different relationships between people. This implies the use of different layers where the nodes are preserved and the relationships are diverse, that is, multiplex networks or biplex networks, for two layers. One major issue in complex networks is the centrality, which aims to classify the most relevant elements in a given system. One of these classic measures of centrality is based on the PageRank classification vector used initially in the Google search engine to order web pages. The PageRank model may be understood as a two-layer network where one layer represents the topology of the network and the other layer is related to teleportation between the nodes. This approach may be extended to define a centrality index for multiplex networks based on the PageRank vector concept. On the other hand, the adapted PageRank algorithm (APA) centrality constitutes a model to obtain the importance of the nodes in a spatial network with the presence of data (both real and virtual). Following the idea of the two-layer approach for PageRank centrality, we can consider the APA centrality under the perspective of a two-layer network where, on the one hand, we keep maintaining the layer of the topological connections of the nodes and, on the other hand, we consider a data layer associated with the network. Following a similar reasoning, we are able to extend the APA model to spatial networks with different layers. The aim of this paper is to propose a centrality measure for biplex networks that extends the adapted PageRank algorithm centrality for spatial networks with data to the PageRank two-layer approach. Finally, we show an example where the ability to analyze data referring to a group of people from different aspects and using different sets of independent data are revealed.
机译:通常,许多复杂网络中的节点的交互需要比简单链路更准确的映射。例如,在社交网络中,可能需要考虑人之间的不同关系。这意味着使用节点被保留的不同层,并且关系是多样化的,即两层的多路复用网络或双方网络。复杂网络中的一个主要问题是中心,旨在对给定系统中的最相关元素进行分类。这些经典的中心度措施之一是基于最初在Google搜索引擎中使用的PageRank分类矢量来订购网页。 PageRank模型可以被理解为双层网络,其中一个层表示网络的拓扑,另一层与节点之间的传送相关。可以扩展这种方法以定义基于PageRank向量概念的多路复用网络的中心性索引。另一方面,适应的PageRank算法(APA)中心地构成了一个模型,以获得空间网络中的节点的重要性,存在数据(真实和虚拟)。以下为PageRank的核心地位两层方法的思路,我们可以一个两层网络的地方,一方面是,我们一直保持节点和拓扑连接层,上视角下考虑APA中心地位另一方面,我们考虑与网络相关联的数据层。在类似的推理之后,我们能够将APA模型扩展到具有不同层的空间网络。本文的目的是提出用于双方网络的中心度测量,该网络用于将适应的PageRank算法中心扩展到空间网络与PageRank两层方法的数据。最后,我们展示了一个示例,其中揭示了分析来自不同方面的一组人和使用不同独立数据的数据的能力。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号