Key nodes mining in transport networks based in PageRank algorithm

Author

Gao Lianxiong ; Wu Jianping ; Rui, Liu

Author_Institution

Sch. of Comput., Beijing Univ. of Posts & Telecommun., Beijing, China

fYear

2009

fDate

17-19 June 2009

Firstpage

4413

Lastpage

4416

Abstract

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.

Keywords

data mining; NodeRank; PageRank algorithm; complex networks; constraint equation; importance measurement; key nodes mining; transport networks; transportation network; Algorithm design and analysis; Area measurement; Complex networks; Equations; Network topology; Physics; Roads; Telecommunication computing; Telecommunication traffic; Transportation; Complex Network; Key Nodes Mining; PageRank Algorithm; Transport Network;

fLanguage

English

Publisher

ieee

Conference_Titel

Control and Decision Conference, 2009. CCDC '09. Chinese

Conference_Location

Guilin

Print_ISBN

978-1-4244-2722-2

Electronic_ISBN

978-1-4244-2723-9

Type

conf

DOI

10.1109/CCDC.2009.5192339

Filename

5192339