A three-stage computational approach to network matching

摘要

Network matching is frequently needed for integrating data that come from different sources. Traditional ways of finding correspondences between network 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 com- putation. AS it used sensitive matching measures, the proposed algorithm promises good improvement to existing algorithms.