Key Nodes Mining in Transport Networks Based on PageRank Algorithm

摘要：

Transport networks display the features of complex networks, in which the vertices importance measurement is crucial. After analyzing some classic importance measurements and the characteristics of transport networks, NodeRank, a new method based on PageRank algorithm, is proposed in this paper to measure the importance of vertices in transportation network. Then the constraint equation is deduced and the existence and uniqueness of solutions are presented. The solving algorithm is described and its convergence is analyzed. Finally, we present a case applying our method to mining key nodes in a real-world transport network.

关键词： Complez Network PageRank Algorithm Transport Network Key Nodes Mining

作者: Gao Lianxiong Wu Jianping Liu Rui

作者单位: School of Computer, Beijing University of Posts & Telecommunications, Beijing 100876 School of Physi School of Physics & Electronics, Yunnan Nationalities University, Kunming 650031, China School of Resources-environment and Geoscience, Yunnan University, Kunming 650091, China

会议类型: 国际会议

会议名称: 2009年中国控制与决策会议(2009 Chinese Control and Decision Conference)

会议地点: 广西桂林

会议语种:英文

页码: 4413-4416

在线出版日期: 2009-06-17（万方平台首次上网日期，不代表论文的发表时间）