Abstract
Several approaches have been proposed to deal with the web service matchmaking problem. Unfortunately, most of these solutions are purely syntactic measures based on the input/output interface specifications of web services and consequently lake accuracy. This is a serious drawback in a fast growing Internet that is facing the challenge to deal with an increasing number of published services. The proposed solutions to cope with this limitation consider the process part of a service description as a graph in the similarity measure. This kind of solutions has better accuracy but suffer from high computational complexity because they rely on time consuming graph matching tools. To avoid this heavy time computing overhead, we propose in this paper a solution that decomposes the process graph into smaller subgraphs and construct similarity of web services based on the similarity of their subgraphs. Simulation results show that our solution is both accurate and fast to compute.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Web ontology language for web services, http://www.w3.org/submission/owl-s/
Beck, M., Freitag, B.: Semantic matchmaking using ranked instance retrieval. In: SMR 2006: 1st International Workshop on Semantic Matchmaking and Resource Retrieval, Co-located with VLDB (2006)
Bellur, U., Kulkarni, R.: Improved matchmaking algorithm for semantic web services based on bipartite graph matching. In: IEEE International Conference on Web Services, ICWS 2007 (2007)
Bellur, U., Vadodaria, H.: On extending semantic matchmaking to include precondition and effect matching. In: International Conference on Web Services, Beijing, China (2008)
Bellur, U., Vadodaria, H., Gupta, A.: Greedy Algorithms. In: Bednorz, W. (ed.) Semantic Matchmaking Algorithms. InTech, Croatia (2008)
Borgwardt, K., Kriegel, H.P.: Shortest-path kernels on graphs. In: 5th Int. Conference on Data Mining, pp. 74–81 (2005)
Bunke, H.: Error correcting graph matching: On the influence of the underlying cost function. IEEE Trans. Pattern Anal. Mach. Intell. 21(9), 917–922 (1999)
Bunke, H.: Recent developments in graph matching. In: ICPR, pp. 2117–2124 (2000)
Bunke, H., Allermann, G.: Inexact graph matching for structural pattern recognition. Pattern Recognition Letters 1, 245–253 (1983)
Corrales, J.C., Grigori, D., Bouzeghoub, M.: Behavioral matchmaking for service retrieval: Application to conversation protocols. Inf. Syst. 33(7-8), 681–698 (2008)
Dijkman, R., Dumas, M., García-Bañuelos, L.: Graph Matching Algorithms for Business Process Model Similarity Search. In: Dayal, U., Eder, J., Koehler, J., Reijers, H.A. (eds.) BPM 2009. LNCS, vol. 5701, pp. 48–63. Springer, Heidelberg (2009)
Dong, X., Halevy, A., Madhavan, J., Nemes, E., Zhang, J.: Simlarity search for web services. In: VLDB 2004, pp. 372–383 (2004)
Garofalakis, M., Kumar, A.: Correlating xml data streams using tree-edit distance embeddings. In: ACM PODS 2003, pp. 143–154. ACM Press, San Diego (2003)
Gater, A., Grigori, D., Bouzeghoub, M.: Owl-s process model matchmaking. In: IEEE International Conference on Web Services, Miami, Florida, USA, July 5-10 (2010)
Guo, J.L.R., Chen, D.: Matching semantic web services across heterogenous ontologies. In: The Fifth International Conference on Computer and Information Technology, CIT 2005 (2005)
Hao, Y., Zhang, Y.: Web services discovery based on schema matching. In: The Thirtieth Australasian Conference on Computer Science, vol. 62 (2007)
Haussler, D.: Convolution kernels on discrete structures. Tech. Rep. UCSC-CRL-99-10, University of California, Santa Cruz (1999)
Horvath, T., Gartner, T., Wrobel, S.: Cyclic pattern kernels for predictive graph mining. In: KDD 2004, pp. 158–167 (2004)
Jouili, S., Mili, I., Tabbone, S.: Attributed Graph Matching Using Local Descriptions. In: Blanc-Talon, J., Philips, W., Popescu, D., Scheunders, P. (eds.) ACIVS 2009. LNCS, vol. 5807, pp. 89–99. Springer, Heidelberg (2009)
Mandell, D., McIlraith, S.: A bottom-up approach to automating web service discovery, customization, and semantic translation. In: Proceedings of the Twelfth International World Wide Web Conference Workshop on E-Services and the Semantic Web (ESSW),Budapest (2003)
M’bareck, N.O.A., Tata, S.: BPEL Behavioral Abstraction and Matching. In: Eder, J., Dustdar, S. (eds.) BPM Workshops 2006. LNCS, vol. 4103, pp. 495–506. Springer, Heidelberg (2006)
Mendling, J., Lassen, K., Zdun, U.: Transformation strategies between block-oriented and graph-oriented process modelling languages. In: Lehner, F., Nsekabel, H., Kleinschmidt, P. (eds.) Multikonferenz Wirtschaftsinformatik, pp. 297–312 (2006)
Messmer, B.: Efficient Graph Matching Algorithms for Preprocessed Model Graphs. Ph.D. thesis, University of Bern, Switzerland (1995)
Messmer, B.T., Bunke, H.: A decision tree approach to graph and subgraph isomorphism detection. Pattern Recognition 32, 1979–1998 (1999)
Nejati, S., Sabetzadeh, M., Chechik, M., Easterbrook, S., Zave, P.: Matching and merging of statecharts specifications. In: ICSE 2007, pp. 54–63 (2007)
Paolucci, M., Kawamura, T., Payne, T.R., Sycara, K.: Semantic Matching of Web Services Capabilities. In: Horrocks, I., Hendler, J. (eds.) ISWC 2002. LNCS, vol. 2342, pp. 333–347. Springer, Heidelberg (2002)
Ramon, J., Gartner, T.: Expressivity versus efficiency of graph kernels. In: First International Workshop on Mining Graphs, Trees and Sequences (2003)
Riesen, K., Bunke, H.: Approximate graph edit distance computation by means of bipartite graph matching. Image and Vision Computing 27, 950–959 (2009)
Sanfeliu, A., Fu, K.: A distance measure between attributed relational graphs for pattern recognition. IEEE Transactions on Systems, Man, and Cybernetics (Part B) 13(3), 353–363 (1983)
Shen, Z., Su, J.: Web service discovery based on behavior signatures. SCC 1, 279–286 (2005)
Vu, L.-H., Porto, F., Hauswirth, M., Aberer, K.: A search engine for qosenabled discovery of semantic web services. International Journal of Business Process Integration and Management 1(4), 244–255 (2006)
Wang, Y., Stroulia, E.: Flexible interface matching for web-service discovery. In: WISE 2003 (2003)
Wombacher, A.: Evaluation of Technical Measures for Workflow Similarity Based on a Pilot Study. In: Meersman, R., Tari, Z. (eds.) OTM 2006, Part I. LNCS, vol. 4275, pp. 255–272. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Seba, H., Lagraa, S., Kheddouci, H. (2012). Web Service Matchmaking by Subgraph Matching. In: Filipe, J., Cordeiro, J. (eds) Web Information Systems and Technologies. WEBIST 2011. Lecture Notes in Business Information Processing, vol 101. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28082-5_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-28082-5_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28081-8
Online ISBN: 978-3-642-28082-5
eBook Packages: Computer ScienceComputer Science (R0)