{"title":"基于PageRank算法的传输网络关键节点挖掘","authors":"Lianxiong Gao, Jianping Wu, Rui Liu","doi":"10.1109/CCDC.2009.5192339","DOIUrl":null,"url":null,"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.","PeriodicalId":127110,"journal":{"name":"2009 Chinese Control and Decision Conference","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2009-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Key nodes mining in transport networks based in PageRank algorithm\",\"authors\":\"Lianxiong Gao, Jianping Wu, Rui Liu\",\"doi\":\"10.1109/CCDC.2009.5192339\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":127110,\"journal\":{\"name\":\"2009 Chinese Control and Decision Conference\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-06-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Chinese Control and Decision Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCDC.2009.5192339\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Chinese Control and Decision Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCDC.2009.5192339","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Key nodes mining in transport networks based in 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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
