Welcome to the InfoSci Platform
Reference Hub4
A Graph-Based Approach for Semantic Process Model Discovery

A Graph-Based Approach for Semantic Process Model Discovery

Ahmed Gater, Daniela Grigori, Mokrane Bouzeghoub
Copyright: © 2012 |Pages: 25
ISBN13: 9781613500538|ISBN10: 161350053X|EISBN13: 9781613500545
DOI: 10.4018/978-1-61350-053-8.ch019
Cite Chapter Cite Chapter

MLA

Gater, Ahmed, et al. "A Graph-Based Approach for Semantic Process Model Discovery." Graph Data Management: Techniques and Applications, edited by Sherif Sakr and Eric Pardede, IGI Global, 2012, pp. 438-462. https://doi.org/10.4018/978-1-61350-053-8.ch019

APA

Gater, A., Grigori, D., & Bouzeghoub, M. (2012). A Graph-Based Approach for Semantic Process Model Discovery. In S. Sakr & E. Pardede (Eds.), Graph Data Management: Techniques and Applications (pp. 438-462). IGI Global. https://doi.org/10.4018/978-1-61350-053-8.ch019

Chicago

Gater, Ahmed, Daniela Grigori, and Mokrane Bouzeghoub. "A Graph-Based Approach for Semantic Process Model Discovery." In Graph Data Management: Techniques and Applications, edited by Sherif Sakr and Eric Pardede, 438-462. Hershey, PA: IGI Global, 2012. https://doi.org/10.4018/978-1-61350-053-8.ch019

Export Reference

Mendeley
Favorite

Abstract

One of the key tasks in the service oriented architecture that Semantic Web services aim to automate is the discovery of services that can fulfill the applications or user needs. OWL-S is one of the proposals for describing semantic metadata about Web services, which is based on the OWL ontology language. Majority of current approaches for matching OWL-S processes take into account only the inputs/outputs service profile. This chapter argues that, in many situations the service matchmaking should take into account also the process model. We present matching techniques that operate on OWL-S process models and allow retrieving in a given repository, the processes most similar to the query. To do so, the chapter proposes to reduce the problem of process matching to a graph matching problem and to adapt existing algorithms for this purpose. It proposes a similarity measure used to rank the discovered services. This measure captures differences in process structure and semantic differences between input/outputs used in the processes.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.