| 一种基于给定目标节点的个性化PageRank算法设计 |
 点此下载全文 |
| 引用本文：易黎?覮.一种基于给定目标节点的个性化PageRank算法设计[J].计算技术与自动化,2020,(1):101-105 |
| 摘要点击次数: 827 |
| 全文下载次数: 0 |
|
|
| 中文摘要:以往衡量图网络节点重要性时，多基于给定源节点，计算该节点到其余目标节点的个性化PageRank值并推出重要目标节点，运算效率低且存储量大。基于此，提出了一种基于给定目标节点的个性化PageRank算法（TPPR），该算法结合本地更新与优先队列算法，通过计算从所有源节点到给定目标节点的个性化PageRank值来推出重要源节点，相较于传统算法运算精度更高，运行时间大幅减少。 |
| 中文关键词:个性化PageRank 目标节点 本地更新算法 优先队列算法 |
| |
| Design of A Personalized PageRant Algorithm Based on A Given Target Node |
|
|
| Abstract:When the importance of the graph network node was measured，the personalized PageRank value of the node to the other target nodes was calculated based on the given source node，and the important target node was launched，which has low computational efficiency and large storage capacity. Based on this，this paper proposes a personalized PageRank algorithm （TPPR） based on a given target node. This algorithm combines the local update and priority queue algorithm to derive important information by calculating the personalized PageRank value from all source nodes to a given target node. The source node is more accurate than the traditional algorithm，and the running time is greatly reduced. |
| keywords:personalized PageRank target node local update algorithm priority queue algorithm |
| 查看全文 查看/发表评论 下载pdf阅读器 |
位访问者,今日访问
