Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

An Automatic Matcher and Linker for Transportation Datasets

These authors contributed equally to this work.
Version 1 : Received: 19 January 2017 / Approved: 20 January 2017 / Online: 20 January 2017 (03:38:06 CET)

A peer-reviewed article of this Preprint also exists.

Masri, A.; Zeitouni, K.; Kedad, Z.; Leroy, B. An Automatic Matcher and Linker for Transportation Datasets. ISPRS Int. J. Geo-Inf. 2017, 6, 29. Masri, A.; Zeitouni, K.; Kedad, Z.; Leroy, B. An Automatic Matcher and Linker for Transportation Datasets. ISPRS Int. J. Geo-Inf. 2017, 6, 29.

Abstract

Multimodality requires integration of heterogeneous transportation data to construct a broad view of the transportation network. Many new transportation services are emerging with being isolated from previously existing networks. This lead them to publish their data sources to the web -- according to Linked Data Principles -- in order to gain visibility. Our interest is to use these data to construct an extended transportation network that links these new services to existing ones. The main problems we tackle in this article fall in the categories of automatic schema matching and data interlinking. We propose an approach that uses web services as mediators to help in automatically detect geospatial properties and map them between two different schemas. On the other hand, we propose a new interlinking approach that enables user to define rich semantic links between datasets in a flexible and customizable way.

Keywords

transportation data; data interlinking; automatic schema matching

Subject

Computer Science and Mathematics, Information Systems

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.