A three-stage computational approach to network matching |
| |
| Authors: | Demin Xiong |
| |
| Institution: | 1. College of Life and Environmental Sciences, Minzu University of China, Beijing 100081, China;2. Engineering Research Center for Food Environment and Health, Beijing 100081, China;1. Utrecht University School of Economics (USE) and Sustainable Finance Lab (SFL), Kriekenpitplein 21-22, 3584, EC, Utrecht, The Netherlands;2. Forum for Reforms, Entrepreneurship and Sustainability (FORES), Kungsbroplan 2, 112 27 Stockholm, Sweden;1. School of Business, Jiangnan University, Wuxi, Jiangsu 214122, China;2. F.C. Manning School of Business Administration, Acadia University, Wolfville, NS B4P 2R6, Canada;3. Odette School of Business, University of Windsor, Windsor, ON N9B 3P4, Canada |
| |
| Abstract: | Network matching is frequently needed for integrating data that come from different sources. Traditional ways of finding correspondences between networks are time-consuming and require considerable manual manipulation. This paper describes a three-stage matching algorithm (node matching, segment matching, and edge matching) that combines bottom-up and top-down procedures to carry out the matching computation. As it uses sensitive matching measures, the proposed algorithm promises good improvement to existing algorithms. An experiment of matching two waterway networks is reported in the paper. The results of this experiment demonstrate that a reasonable matching rate and good computational efficiency can be achieved with this algorithm. The paper also briefly discusses necessary improvements in areas of linear alignment, aspatial matching and higher-level matching. |
| |
| Keywords: | Network matching Spatial data integration Three-stage computation GIS |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
