Shu, Gao, Rana, Omer Farooq ![]() |
Abstract
As a greater number of Web Services are made available, support for service discovery mechanisms become essential. Services can have quite different Quality of Service characteristics (such as their response time when given a particular set of data). A service requestor therefore requires more sophisticated approaches to find a service that meets a particular behavior, because supporting matching between a service request and properties is not straightforward. Matchmaking plays a vital role in this discovery process. We propose a novel matchmaking algorithm to effectively compute the semantic distance of concepts in an ontology. It is based on description logic formalization and reasoning, extends simple subsumption matching found in other approaches and allows match ranking. We have implemented the proposed approach and used the developed prototype in the context of service discovery in the visualization domain.
Item Type: | Article |
---|---|
Date Type: | Publication |
Status: | Published |
Schools: | Computer Science & Informatics |
Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
Uncontrolled Keywords: | Semantic Web; Ontology; Description logics; Matchmaking |
Publisher: | Elsevier |
ISSN: | 0965-9978 |
Last Modified: | 17 Oct 2022 09:01 |
URI: | https://orca.cardiff.ac.uk/id/eprint/1863 |
Citation Data
Cited 53 times in Scopus. View in Scopus. Powered By Scopus® Data
Actions (repository staff only)
![]() |
Edit Item |