Parameterized algorithms for matching and ranking web services

Fatma-Ezzahra Gmati, Nadia Yacoubi-Ayadi, Salem Chakhar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

96 Downloads (Pure)

Abstract

The paper presents two parameterized and customizable algorithms for matching and ranking Web services. Given a user query and a set of available Web services, the matching algorithm performs a logic-based semantic matchmaking to select services that functionally match the query and maintains those which fully verify the constraints specified by the user. The ranking algorithm takes as input the matching Web services, assigns to each one a score in the range 0-1 and finally rank them based on the score values. The algorithms have been implemented, evaluated and compared to iSEM and SPARQLent. Results show that the algorithms behave globally well in comparison to these frameworks.
Original languageEnglish
Title of host publicationOn the Move to Meaningful Internet Systems, OTM 2014 Conferences
Subtitle of host publicationConfederated International Conferences: CoopIS, and ODBASE 2014, Amantea, Italy, October 27-31, 2014, Proceedings
EditorsRobert Meersman, Hervé Panetto, Tharam Dillon, Michele Missikoff, Lin Liu, Oscar Pastor, Alfredo Cuzzocrea, Timos Sellis
Place of PublicationBerlin Heidelberg
PublisherSpringer
Pages784-791
Number of pages8
ISBN (Electronic)978-3662455630
ISBN (Print)978-3662455623
DOIs
Publication statusPublished - 2014

Publication series

NameLecture Notes in Computer Science
Volume 8841

Fingerprint

Dive into the research topics of 'Parameterized algorithms for matching and ranking web services'. Together they form a unique fingerprint.

Cite this