S. Lagraa
ABSTRACT
With the development of e-commerce over Internet, web service discovery received much interest. A critical aspect of web service discovery is web service similarity search or matchmaking. To enhance the similarity precision, several solutions that do not limit to a syntactic comparison of inputs and outputs of the compared services have been proposed. Most of them introduce the structure of web service operations in the similarity measure. In this paper, we analyze these approaches and point out their time complexity drawback. Then, we propose a more efficient matching algorithm based on the concept of decomposition kernels of graphs. We study the complexity of our approach and present performance analysis.
- Universal description discovery and integration, http://uddi.xml.org/.Google Scholar
- Web ontology language for web services, http://www.w3.org/submission/owl-s/.Google Scholar
- Web services description language, http://www.w3.org/tr/wsdl.Google Scholar
- M. Beck and B. Freitag. Semantic matchmaking using ranked instance retrieval. In proceedings of SMR'06: 1st International Workshop on Semantic Matchmaking and Resource Retrieval, Co-located with VLDB, 2006.Google Scholar
- U. Bellur, H. Vadodaria, and A. Gupta. Semantic Matchmaking Algorithms, chapter Greedy Algorithms. Witold Bednorz, InTech, Croatia, 2008.Google Scholar
- K. Borgwardt and H.-P. Kriegel. Shortest-path kernels on graphs. In 5th Int. Conference on Data Mining, pages 74--81, 2005. Google ScholarDigital Library
- H. Bunke. Recent developments in graph matching. In International Conference on Pattern Recognition, pages 2117--2124, 2000.Google ScholarCross Ref
- H. Bunke and G. Allermann. Inexact graph matching for structural pattern recognition. Pattern Recognition Letters, 1: 245--253, 1983.Google ScholarDigital Library
- J. C. Corrales, D. Grigori, and M. Bouzeghoub. Behavioral matchmaking for service retrieval: Application to conversation protocols. Information Systems, 33(7--8): 681--698, 2008. Google ScholarDigital Library
- R. Dijkman, M. Dumas, and L. Garcia-Banuelos. Business Process Management, LNCS 570, pages 48--63. 2009.Google Scholar
- X. Dong, A. Halevy, J. Madhavan, E. Nemes, and J. Zhang. Simlarity search for web services. In VLDB2004, pages 372--383, 2004. Google ScholarDigital Library
- M. Garofalakis and A. Kumar. Correlating xml data streams using tree-edit distance embeddings. In ACM PODS'2003. San Diego, California, June 2003, pages 143--154. ACM Press, 2003. Google ScholarDigital Library
- T. Gartner, P. Flach, and S. Wrobel. On graph kernels: Hardness results and efficient alternatives. In Springer, editor, Annual Conf. Computational Learning Theory, pages 129--143, 2003.Google Scholar
- Y. Hao and Y. Zhang. Web services discovery based on schema matching. In the thirtieth Australasian conference on Computer science - Volume 62, 2007. Google ScholarDigital Library
- D. Haussler. Convolution kernels on discrete structures. Technical Report UCSC-CRL-99-10, University of California, Santa Cruz, 1999.Google Scholar
- T. Horvath, T. Gartner, and S. Wrobel. Cyclic pattern kernels for predictive graph mining. KDD 2004, pages 158--167, 2004. Google ScholarDigital Library
- S. Lagraa, H. Seba, R. Khennoufa, and H. Kheddouci. A graph decomposition approach to web service matchmaking. In 7th International Conference on Web Information Systems and Technologies (WEBIST), 2011.Google Scholar
- C. L. Lu, Z.-Y. Su, and G. Y. Tang. A new measure of edit distance between labeled trees. LNCS, Springer-Verlag Heidelberg, pages 338--348, 2001. Google ScholarDigital Library
- D. Mandell and S. McIlraith. 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.Google Scholar
- B. Messmer. Efficient Graph Matching Algorithms for Preprocessed Model Graphs. PhD thesis, University of Bern, Switzerland, 1995.Google Scholar
- B. T. Messmer and H. Bunke. A decision tree approach to graph and subgraph isomorphism detection. Pattern Recognition, 32: 1979--1998, 1999.Google ScholarCross Ref
- M. Neuhaus and H. Bunke. A convolution edit kernel for errortolerant graph matching. In IEEE international conference on pattern recognition, Hong Kong, pages 220--223, 2006. Google ScholarDigital Library
- T. Paolucci, T. Kawmura, and K. Sycara. Semantic matching of web service capabilities. In Springer Verlag, LNCS, Proceedings of the International Semantic Web Conference, 2002. Google ScholarDigital Library
- F. Porto, L.-H. Vu, M. Hauswirth, and K. Aberer. A search engine for qos enabled discovery of semantic web services. International Journal of Business Process Integration and Management, 1(4): 244--255, 2006.Google ScholarCross Ref
- J. Ramon and T. Gartner. Expressivity versus efficiency of graph kernels. In First International Workshop on Mining Graphs, Trees and Sequences, 2003.Google Scholar
- A. Sanfeliu and K. Fu. A distance measure between attributed relational graphs for pattern recognition. IEEE Transactions on Systems, Man, and Cybernetics (Part B), 13(3): 353--363, 1983.Google ScholarCross Ref
- K. Shin and T. Kuboyama. A generalization of haussler's convolution kernel-mapping kernel. In the 25th International Conference on Machine Learning, Helsinki, Finland, 2008. Google ScholarDigital Library
- Y. Wang and E. Stroulia. Flexible interface matching for web-service discovery. In WISE'2003, 2003. Google ScholarDigital Library
Index Terms
- Matchmaking OWL-S processes: an approach based on path signatures
Recommendations
Web Service Matchmaking Using a Hybrid of Signature and Specification Matching Methods
WI-IAT '14: Proceedings of the 2014 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT) - Volume 02Web services are independent software systems designed to offer machine-to-machine interactions over the WWW to achieve well-described operations. Web Service Matchmaking is a process of searching (or discovering) for a web service within a service ...
Bringing Semantics to Web Services with OWL-S
Current industry standards for describing Web Services focus on ensuring interoperability across diverse platforms, but do not provide a good foundation for automating the use of Web Services. Representational techniques being developed for the Semantic ...
A Comparative Study between WSCI, WS-CDL, and OWL-S
ICEBE '09: Proceedings of the 2009 IEEE International Conference on e-Business EngineeringChoreography languages allow us to describe Web Services compositions from a global viewpoint in Service Oriented Architectures (SOA). However, none of the existing languages has achieved the status of de facto standard for that purpose until now. In ...
Comments