Flexible service discovery based on multiple matching algorithms
by Fethallah Hadjila; Amine Belabed; Mohammed Merzoug
International Journal of Web Engineering and Technology (IJWET), Vol. 14, No. 4, 2019

Abstract: Traditional web service discovery approaches rely on logic or non-logic matching techniques. In general, logic approaches can achieve satisfactory precision levels, but they result in modest recall scores. In contrast, non-logic approaches may ensure more balanced scores in terms of recall and precision, but they need additional aggregation schemes or optimisation methods. To improve the discovery performance, we need to combine multiple matching algorithms and fuse their results into a single ranked list of services. This combination must avoid the well-known side effects of fusion, such as overfitting or noise sensitivity. To tackle the service-discovery issue, we propose a solution based on two key ideas: first, we propose a majority voting model based on the 'Condorcet' paradigm to fuse a set of individual ranked lists (provided by the matching functions). Second, we leverage a probabilistic extension of the dominance relationship to ensure comparison between the services. The experimental evaluations indicate the proposed solution, 'probabilistic Condorcet', outperforms all individual matching functions, as well as many concurrent fusion algorithms.

Online publication date: Tue, 03-Mar-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Web Engineering and Technology (IJWET):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com