loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: S. Lagraa ; H. Seba ; R. Khennoufa and H. Kheddouci

Affiliation: Université Claude Bernard Lyon1 and Université de Lyon, France

Keyword(s): Web services, Semantic web services, OWL-S, Graph matching, Graph decomposition, Graph edit distance, Graph kernel.

Related Ontology Subjects/Areas/Topics: Internet Technology ; Ontology and the Semantic Web ; Web Information Systems and Technologies ; Web Interfaces and Applications ; Web Services and Web Engineering

Abstract: Web service discovery is becoming a critical issue in several fields. The current approaches for service discovery and mainly semantic web services such as OWL-S are limited primarily to the matching of their inputs/outputs at the level of an ontology. Recent studies show that this approach does not suffice to discover web services and that the structure of web services has an important and necessary weight in the efficiency of the matching. The structure of a web service can be represented by a graph. The problem of matching semantic web services is then translated into a problem of graph matching. In this work, we propose a matching approach that first decomposes the web service graph into more simple sub-structures then, the matching process is achieved onto these substructures. The proposed algorithms achieve better time complexity than existing ones. We also propose a semantic similarity to enhance our structural similarity.

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 18.219.253.199

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Lagraa, S.; Seba, H.; Khennoufa, R. and Kheddouci, H. (2011). A GRAPH DECOMPOSITION APPROACH TO WEB SERVICE MATCHMAKING. In Proceedings of the 7th International Conference on Web Information Systems and Technologies - WEBIST; ISBN 978-989-8425-51-5; ISSN 2184-3252, SciTePress, pages 31-40. DOI: 10.5220/0003338200310040

@conference{webist11,
author={S. Lagraa. and H. Seba. and R. Khennoufa. and H. Kheddouci.},
title={A GRAPH DECOMPOSITION APPROACH TO WEB SERVICE MATCHMAKING},
booktitle={Proceedings of the 7th International Conference on Web Information Systems and Technologies - WEBIST},
year={2011},
pages={31-40},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003338200310040},
isbn={978-989-8425-51-5},
issn={2184-3252},
}

TY - CONF

JO - Proceedings of the 7th International Conference on Web Information Systems and Technologies - WEBIST
TI - A GRAPH DECOMPOSITION APPROACH TO WEB SERVICE MATCHMAKING
SN - 978-989-8425-51-5
IS - 2184-3252
AU - Lagraa, S.
AU - Seba, H.
AU - Khennoufa, R.
AU - Kheddouci, H.
PY - 2011
SP - 31
EP - 40
DO - 10.5220/0003338200310040
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic