Hierarchical Matching of Traffic Information Services Using Semantic Similarity

Service matching aims to find the information similar to a given query, which has numerous applications in web search. Although existing methods yield promising results, they are not applicable for transportation. In this paper, we propose a multilevel matching method based on semantic technology, t...

Full description

Saved in:
Bibliographic Details
Main Authors: Zongtao Duan, Lei Tang, Zhiliang Kou, Yishui Zhu
Format: Article
Language:English
Published: Wiley 2018-01-01
Series:Journal of Advanced Transportation
Online Access:http://dx.doi.org/10.1155/2018/2041503
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1832550742719725568
author Zongtao Duan
Lei Tang
Zhiliang Kou
Yishui Zhu
author_facet Zongtao Duan
Lei Tang
Zhiliang Kou
Yishui Zhu
author_sort Zongtao Duan
collection DOAJ
description Service matching aims to find the information similar to a given query, which has numerous applications in web search. Although existing methods yield promising results, they are not applicable for transportation. In this paper, we propose a multilevel matching method based on semantic technology, towards efficiently searching the traffic information requested. Our approach is divided into two stages: service clustering, which prunes candidate services that are not promising, and functional matching. The similarity at function level between services is computed by grouping the connections between the services into inheritance and noninheritance relationships. We also developed a three-layer framework with a semantic similarity measure that requires less time and space cost than existing method since the scale of candidate services is significantly smaller than the whole transportation network. The OWL_TC4 based service set was used to verify the proposed approach. The accuracy of offline service clustering reached 93.80%, and it reduced the response time to 651 ms when the total number of candidate services was 1000. Moreover, given the different thresholds for the semantic similarity measure, the proposed mixed matching model did better in terms of recall and precision (i.e., up to 72.7% and 80%, respectively, for more than 1000 services) compared to the compared models based on information theory and taxonomic distance. These experimental results confirmed the effectiveness and validity of service matching for responding quickly and accurately to user queries.
format Article
id doaj-art-101a3b9f93ef4516b46fa96f6598a720
institution Kabale University
issn 0197-6729
2042-3195
language English
publishDate 2018-01-01
publisher Wiley
record_format Article
series Journal of Advanced Transportation
spelling doaj-art-101a3b9f93ef4516b46fa96f6598a7202025-02-03T06:05:56ZengWileyJournal of Advanced Transportation0197-67292042-31952018-01-01201810.1155/2018/20415032041503Hierarchical Matching of Traffic Information Services Using Semantic SimilarityZongtao Duan0Lei Tang1Zhiliang Kou2Yishui Zhu3School of Information Engineering, Chang’an University, Xi’an, Shaanxi, ChinaSchool of Information Engineering, Chang’an University, Xi’an, Shaanxi, ChinaSchool of Information Engineering, Chang’an University, Xi’an, Shaanxi, ChinaSchool of Information Engineering, Chang’an University, Xi’an, Shaanxi, ChinaService matching aims to find the information similar to a given query, which has numerous applications in web search. Although existing methods yield promising results, they are not applicable for transportation. In this paper, we propose a multilevel matching method based on semantic technology, towards efficiently searching the traffic information requested. Our approach is divided into two stages: service clustering, which prunes candidate services that are not promising, and functional matching. The similarity at function level between services is computed by grouping the connections between the services into inheritance and noninheritance relationships. We also developed a three-layer framework with a semantic similarity measure that requires less time and space cost than existing method since the scale of candidate services is significantly smaller than the whole transportation network. The OWL_TC4 based service set was used to verify the proposed approach. The accuracy of offline service clustering reached 93.80%, and it reduced the response time to 651 ms when the total number of candidate services was 1000. Moreover, given the different thresholds for the semantic similarity measure, the proposed mixed matching model did better in terms of recall and precision (i.e., up to 72.7% and 80%, respectively, for more than 1000 services) compared to the compared models based on information theory and taxonomic distance. These experimental results confirmed the effectiveness and validity of service matching for responding quickly and accurately to user queries.http://dx.doi.org/10.1155/2018/2041503
spellingShingle Zongtao Duan
Lei Tang
Zhiliang Kou
Yishui Zhu
Hierarchical Matching of Traffic Information Services Using Semantic Similarity
Journal of Advanced Transportation
title Hierarchical Matching of Traffic Information Services Using Semantic Similarity
title_full Hierarchical Matching of Traffic Information Services Using Semantic Similarity
title_fullStr Hierarchical Matching of Traffic Information Services Using Semantic Similarity
title_full_unstemmed Hierarchical Matching of Traffic Information Services Using Semantic Similarity
title_short Hierarchical Matching of Traffic Information Services Using Semantic Similarity
title_sort hierarchical matching of traffic information services using semantic similarity
url http://dx.doi.org/10.1155/2018/2041503
work_keys_str_mv AT zongtaoduan hierarchicalmatchingoftrafficinformationservicesusingsemanticsimilarity
AT leitang hierarchicalmatchingoftrafficinformationservicesusingsemanticsimilarity
AT zhiliangkou hierarchicalmatchingoftrafficinformationservicesusingsemanticsimilarity
AT yishuizhu hierarchicalmatchingoftrafficinformationservicesusingsemanticsimilarity