Geographically Modified PageRank Algorithms: Measuring the Importance of Nodes in a Geospatial Network
碩士 === 國立臺灣大學 === 地理環境資源學研究所 === 101 === A geospatial network represents the spatial relationships with the network perspective. Within the scope of social network analysis, the network topology characteristics, including network centrality, small world and scale-free properties, have been well stu...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2013
|
Online Access: | http://ndltd.ncl.edu.tw/handle/46954668310102513613 |
id |
ndltd-TW-101NTU05136141 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-101NTU051361412015-10-13T23:10:18Z http://ndltd.ncl.edu.tw/handle/46954668310102513613 Geographically Modified PageRank Algorithms: Measuring the Importance of Nodes in a Geospatial Network 考量地理特性的PageRank演算法:評估地理網絡節點之重要性 Wei Chien Benny Chin 陳威全 碩士 國立臺灣大學 地理環境資源學研究所 101 A geospatial network represents the spatial relationships with the network perspective. Within the scope of social network analysis, the network topology characteristics, including network centrality, small world and scale-free properties, have been well studied, and these concepts can also provide important implications on measuring the important of places in the geospatial network. PageRank (PR), which is an important link analysis algorithm, is what Google uses to determine how important a page is on the web. However, most measures of network analysis were designed to understand network topological structures rather than geographical structures. Therefore, these measures have not considered the geographical relationships as their main concern, including geographical distance decay effect between nodes. This study incorporates geographic properties, including distance-decay and spatial interactions among nodes, and proposes two modified PR algorithms, Inverse-Distance PageRank (IDPR) and Geographical PageRank (GPR). To test the performance of the index of importance (including IDPR and GPR), this study did two experiments with the inter-city network of Taiwan. In the first experiment, this study calculated the index of importance, and this study used the population data and inter-townships car flow data as observed data to check the Spearman Rank Correlation, and compared the correlation results with existing algorithms: PR and Weighted PageRank (WPR); in the second experiment, this study explore the changes of node’s importance between before and after the construction of Taiwan High Speed Rail System. Our findings in the first experiment showed that IDPR and GPR are better correlated to the observed data, and our findings in the second experiment showed that the GPR and WPR could capture the transitive effect. Since IDPR and GPR take the distance decay effect into account, results using the algorithms can capture more geographical properties. In conclusion, IDPR and GPR are better metrics to be used in geospatial network analysis; but, if the transitive effect is an important feature in the analysis, GPR is a better metric. Tzai-Hung Wen 溫在弘 2013 學位論文 ; thesis 99 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立臺灣大學 === 地理環境資源學研究所 === 101 === A geospatial network represents the spatial relationships with the network perspective. Within the scope of social network analysis, the network topology characteristics, including network centrality, small world and scale-free properties, have been well studied, and these concepts can also provide important implications on measuring the important of places in the geospatial network. PageRank (PR), which is an important link analysis algorithm, is what Google uses to determine how important a page is on the web. However, most measures of network analysis were designed to understand network topological structures rather than geographical structures. Therefore, these measures have not considered the geographical relationships as their main concern, including geographical distance decay effect between nodes. This study incorporates geographic properties, including distance-decay and spatial interactions among nodes, and proposes two modified PR algorithms, Inverse-Distance PageRank (IDPR) and Geographical PageRank (GPR). To test the performance of the index of importance (including IDPR and GPR), this study did two experiments with the inter-city network of Taiwan. In the first experiment, this study calculated the index of importance, and this study used the population data and inter-townships car flow data as observed data to check the Spearman Rank Correlation, and compared the correlation results with existing algorithms: PR and Weighted PageRank (WPR); in the second experiment, this study explore the changes of node’s importance between before and after the construction of Taiwan High Speed Rail System. Our findings in the first experiment showed that IDPR and GPR are better correlated to the observed data, and our findings in the second experiment showed that the GPR and WPR could capture the transitive effect. Since IDPR and GPR take the distance decay effect into account, results using the algorithms can capture more geographical properties. In conclusion, IDPR and GPR are better metrics to be used in geospatial network analysis; but, if the transitive effect is an important feature in the analysis, GPR is a better metric.
|
author2 |
Tzai-Hung Wen |
author_facet |
Tzai-Hung Wen Wei Chien Benny Chin 陳威全 |
author |
Wei Chien Benny Chin 陳威全 |
spellingShingle |
Wei Chien Benny Chin 陳威全 Geographically Modified PageRank Algorithms: Measuring the Importance of Nodes in a Geospatial Network |
author_sort |
Wei Chien Benny Chin |
title |
Geographically Modified PageRank Algorithms: Measuring the Importance of Nodes in a Geospatial Network |
title_short |
Geographically Modified PageRank Algorithms: Measuring the Importance of Nodes in a Geospatial Network |
title_full |
Geographically Modified PageRank Algorithms: Measuring the Importance of Nodes in a Geospatial Network |
title_fullStr |
Geographically Modified PageRank Algorithms: Measuring the Importance of Nodes in a Geospatial Network |
title_full_unstemmed |
Geographically Modified PageRank Algorithms: Measuring the Importance of Nodes in a Geospatial Network |
title_sort |
geographically modified pagerank algorithms: measuring the importance of nodes in a geospatial network |
publishDate |
2013 |
url |
http://ndltd.ncl.edu.tw/handle/46954668310102513613 |
work_keys_str_mv |
AT weichienbennychin geographicallymodifiedpagerankalgorithmsmeasuringtheimportanceofnodesinageospatialnetwork AT chénwēiquán geographicallymodifiedpagerankalgorithmsmeasuringtheimportanceofnodesinageospatialnetwork AT weichienbennychin kǎoliàngdelǐtèxìngdepagerankyǎnsuànfǎpínggūdelǐwǎngluòjiédiǎnzhīzhòngyàoxìng AT chénwēiquán kǎoliàngdelǐtèxìngdepagerankyǎnsuànfǎpínggūdelǐwǎngluòjiédiǎnzhīzhòngyàoxìng |
_version_ |
1718084205920911360 |