Abstract
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 language | English |
---|---|
Title of host publication | Proceedings of the 12th international conference on web information systems and technologies (WEBIST 2016), Rome Italy, April 23-25 |
Editors | Tim A. Majchrzak, Paolo Traverso, Valérie Monfort, Karl-Heinz Krempels |
Place of Publication | Portugal |
Publisher | SciTePress |
Pages | 54-65 |
Number of pages | 12 |
Volume | 1 |
ISBN (Print) | 978-989-758-186-1 |
DOIs | |
Publication status | Published - 2016 |
Event | 12th International Conference on Web Information Systems and Technologies - Rome, Italy Duration: 23 Apr 2016 → 25 Apr 2016 |
Conference
Conference | 12th International Conference on Web Information Systems and Technologies |
---|---|
Abbreviated title | WEBIST 2016 |
Country/Territory | Italy |
City | Rome |
Period | 23/04/16 → 25/04/16 |
Keywords
- Web service
- Semantic similarity
- Matchmaking
- Ranking
- Performance