Spectral Graph Approach for Process Model Matchmaking

Yacine Belhoul (1) , Mohammed Haddad (1) , Ahmed Gater (2) , Daniela Grigori (3) , Hamamache Kheddouci (1) , Mokrane Bouzeghoub (2)

1 GrAMA - Graphes, Algorithmes et Multi-Agents
2 PRISM - Parallélisme, Réseaux, Systèmes, Modélisation
3 LAMSADE - Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision

In this paper, we propose a novel approach for graph based web service matching. Our approach is inspired by spectral graph matching methods; in particular, by eigenbased projections. We introduce new mechanisms to perform the matchmaking at both structural and semantic levels. These mechanisms are based on algebraic graph techniques that make them run fast and thus suitable for large scale web service matching problems. Experimentation is provided to show the performance of the proposed approach

Domaines: Informatique [cs]

Yacine Belhoul, Mohammed Haddad, Ahmed Gater, Daniela Grigori, Hamamache Kheddouci, et al.. Spectral Graph Approach for Process Model Matchmaking. IEEE 10th International Conference on Services Computing (SCC), Jun 2013, Santa Clara Marriott, CA, USA (Center of Silicon Valley), United States. pp.408-415. ⟨hal-01339191⟩