Skip to content

A framework for parameterized semantic matchmaking and ranking of web services

Research output: Chapter in Book/Report/Conference proceedingChapter (peer-reviewed)peer-review

The Parameterized Semantic Matchmaking and Ranking (PMRF) is a highly configurable framework supporting a parameterized matching and ranking of Web services. The paper introduces the matching and ranking algorithms supported by the PMRF and presents its architecture. It also evaluates the performance of the PMRF and compares it to the iSeM-logic-based and SPARQLent frameworks using the OWLS-TC4 datasets. The comparison results show that the algorithms included in PMRF behave globally well in comparison to iSeM-logic-based and SPARQLent.
Original languageEnglish
Title of host publicationProceedings of the 12th international conference on web information systems and technologies (WEBIST 2016), Rome Italy, April 23-25
EditorsTim A. Majchrzak, Paolo Traverso, Valérie Monfort, Karl-Heinz Krempels
Place of PublicationPortugal
PublisherSciTePress
Pages54-65
Number of pages12
Volume1
ISBN (Print)978-989-758-186-1
DOIs
Publication statusPublished - 2016
Event12th International Conference on Web Information Systems and Technologies - Rome, Italy
Duration: 23 Apr 201625 Apr 2016

Conference

Conference12th International Conference on Web Information Systems and Technologies
Abbreviated titleWEBIST 2016
CountryItaly
CityRome
Period23/04/1625/04/16

Related information

Relations Get citation (various referencing formats)

ID: 3499952