Semantic web service discovery system for road traffic information services
Impact
![Google Scholar](/xmlui/themes/Mirage2/images/uji/logo_google.png)
![Microsoft Academico](/xmlui/themes/Mirage2/images/uji/logo_microsoft.png)
Metadata
Show full item recordcomunitat-uji-handle:10234/9
comunitat-uji-handle2:10234/7038
comunitat-uji-handle3:10234/8634
comunitat-uji-handle4:
INVESTIGACIONThis resource is restricted
http://dx.doi.org/10.1016/j.eswa.2015.01.005 |
Metadata
Title
Semantic web service discovery system for road traffic information servicesAuthor (s)
Date
2015Publisher
ElsevierISSN
0957-4174Bibliographic citation
ZAPATER, J. Javier Samper, et al. Semantic web service discovery system for road traffic information services. Expert Systems with Applications, 2015, vol. 42, no 8, p. 3833-3842.Type
info:eu-repo/semantics/articlePublisher version
http://www.sciencedirect.com/science/article/pii/S0957417415000202Subject
Abstract
We describe a multi-agent platform for a traveller information system, allowing travellers to find the road traffic information web service (WSs) that best fits their requirements. After studying existing proposals ... [+]
We describe a multi-agent platform for a traveller information system, allowing travellers to find the road traffic information web service (WSs) that best fits their requirements. After studying existing proposals for discovery of semantic WS, we implemented a hybrid matching algorithm, which is described in detail here. Semantic WS profiles are annotated semantically as an OWL-S and also the traveller request is represented as a OWL-S profile. The algorithm assigns different weights and measures to each advertised WS profile parameter, depending on their relevance, type and nature. To do this we have extended Paolucci’s Algorithm and adapted it to our scenario. We have added new similarity measures, in particular, the use of the ‘sibling’ relationship, to improve the recall, allowing relevant services to be discovered by the users yet not retrieved by other algorithms. Although we have increased the similarity concept relations, we have improved the run-time using a pre-process filter step that reduces the set of potentially useful WS. This improves the scalability of the semantic matching algorithm. [-]
Is part of
Expert Systems with Applications Volume 42, Issue 8, 15 May 2015, Pages 3833–3842Rights
Copyright © 2015 Elsevier Ltd. All rights reserved.
http://rightsstatements.org/vocab/InC/1.0/
info:eu-repo/semantics/restrictedAccess
http://rightsstatements.org/vocab/InC/1.0/
info:eu-repo/semantics/restrictedAccess
This item appears in the folowing collection(s)
- LSI_Articles [362]