• français
    • English
  • français 
    • français
    • English
  • Connexion
JavaScript is disabled for your browser. Some features of this site may not work without it.
Accueil

Afficher

Cette collectionPar Date de CréationAuteursTitresSujetsNoms de revueToute la baseCentres de recherche & CollectionsPar Date de CréationAuteursTitresSujetsNoms de revue

Mon compte

Connexion

Statistiques

Afficher les statistiques d'usage

A summary-based approach for enhancing process model matchmaking

Thumbnail
Date
2011
Indexation documentaire
Programmation, logiciels, organisation des données
Subject
mapping; graph summarization technique; process models
Titre du colloque
SOCA 2011
Date du colloque
11-2012
Ville du colloque
Irvine
Pays du colloque
États-Unis
Titre de l'ouvrage
Service-Oriented Computing and Applications (SOCA), 2011 IEEE International Conference on
Nom de l'éditeur
IEEE
Année
2011
ISBN
(E-ISBN) 978-1-4673-0317-0 (Print ISBN) 978-1-4673-0318-7
URL de l'ouvrage
http://dx.doi.org/10.1109/SOCA.2011.6166210
URI
https://basepub.dauphine.fr/handle/123456789/8827
Collections
  • LAMSADE : Publications
Métadonnées
Afficher la notice complète
Auteur
Kheddouci, H.
Bouzeghoub, Mokrane
Grigori, Daniela
Gater, Ahmed
Type
Communication / Conférence
Nombre de pages du document
1-8
Résumé en anglais
The importance gained by the process models in modern information systems led to the increasing proliferation of process model repositories. Matching process models and assessing their similarity are critical functionalities required for the management of these collections. In this work1 we present an efficient graph-based technique for matching and evaluating the similarity of semantically annotated process models. Approximate graph matching algorithms which are used in literature (e.g., error correcting sub-graph isomorphism detection), are exponential in size of the graphs. In order to reduce the execution time and improve the applicability of the algorithm for matching and retrieval of process models, we propose a graph summarization technique which reduces the size of the graphs to be compared. Moreover, while most of the related works detect only 1-1 activity mappings, our matching approach is able to detect complex mappings (m-n) between activities based on their input/output sets. Experiments showed that the summarization technique reduces considerably the execution time, maintaining at the same time a good quality of the matching.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Cette création est mise à disposition sous un contrat Creative Commons.