A THREE-STAGE COMPUTATIONAL APPROACH TO NETWORK MATCHING

Network matching is frequently required to integrate data that comes from different sources. Traditional ways of finding correspondences between networks are time-consuming and require considerable manual manipulation. This paper describes a 3-stage matching algorithm 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 2 waterway networks is reported in the paper. Results of this experiment demonstrate that a reasonable matching rate and good computational efficiency results can be achieved with this algorithm. The paper also briefly discusses necessary improvements in areas of linear alignment, aspatial matching, and higher-level matching.

• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/issn/0968090X
• Corporate Authors:

  Elsevier

  The Boulevard, Langford Lane
  Kidlington, Oxford  United Kingdom  OX5 1GB
• Authors:
  • Xiong, D
• Publication Date: 2000-2

Language

• English

Media Info

• Features: Figures; References; Tables;
• Pagination: p. 71-89
• Serial:
  • Transportation Research Part C: Emerging Technologies
  • Volume: 8
  • Issue Number: 1
  • Publisher: Elsevier
  • ISSN: 0968-090X
  • Serial URL: http://www.sciencedirect.com/science/journal/0968090X

Subject/Index Terms

• TRT Terms: Algorithms; Geographic information systems; Highway planning; Highway transportation; Navigation; Networks; Spatial analysis; Waterways
• Uncontrolled Terms: Data integration; Network matching
• Subject Areas: Highways; Marine Transportation; Operations and Traffic Management; Planning and Forecasting; I72: Traffic and Transport Planning;

Filing Info

• Accession Number: 00800319
• Record Type: Publication
• Files: TRIS, ATRI
• Created Date: Oct 3 2000 12:00AM