DocumentCode
1973329
Title
Spectral Graph Approach for Process Model Matchmaking
Author
Belhoul, Yacine ; Haddad, Mario ; Gater, Ahmed ; Grigori, Daniela ; Kheddouci, Hamamache ; Bouzeghoub, Mokrane
Author_Institution
LIRIS, Univ. de Lyon, Lyon, France
fYear
2013
fDate
June 28 2013-July 3 2013
Firstpage
408
Lastpage
415
Abstract
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 eigen-based 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.
Keywords
algebra; eigenvalues and eigenfunctions; graph theory; Web service matching problems; algebraic graph; eigen based projections; graph based Web service matching; process model matchmaking; semantic levels; spectral graph matching methods; Analytical models; Computational modeling; Connectors; Eigenvalues and eigenfunctions; Matrix decomposition; Semantics; Symmetric matrices; process model matchmaking; spectral graph; structural and semantic matching;
fLanguage
English
Publisher
ieee
Conference_Titel
Services Computing (SCC), 2013 IEEE International Conference on
Conference_Location
Santa Clara, CA
Print_ISBN
978-0-7695-5026-8
Type
conf
DOI
10.1109/SCC.2013.27
Filename
6649722
Link To Document