.png){kind=icon}
返回
Node Aggregation for Enhancing PageRank
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2017.2750700.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we study the problem of node aggregation under different perspectives for increasing PageRank of some nodes of interest. PageRank is one of the parameters used by the search engine Google to determine the relevance of a web page. We focus our attention to the problem of finding the best nodes in the network from an aggregation viewpoint, i.e., what are the best nodes to merge with for the given nodes. This problem is studied from global and local perspectives. Approximations are proposed to reduce the computation burden and to overcome the limitations resulting from the lack of centralized information. Several examples are presented to illustrate the different approaches that we propose.
Keyword:
Networks
game theory
graphs
centrality measures
model reduction
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
.png){kind=icon}
分享收藏Optimal Relay Function in the Low-Power Regime for Distributed Estimation Over a MAC在MAC上进行分布式估计的低功耗状态下的最佳中继功能
PREAI
分享收藏
查看更多内容