A kernel based structure matching for web services search

This paper describes a kernel based Web Services (abbreviated as service) matching mechanism for service discovery and integration. The matching mechanism tries to exploit the latent semantics by the structure of services. Using textual similarity and n-spectrum kernel values as features of low-level and mid-level, we build up a model to estimate the functional similarity between services, whose parameters are learned by a Ranking-SVM. The experiment results showed that several metrics for the retrieval of services have been improved by our approach. Categories and Subject Descriptors H.3.3 [Information Storage and Retrieval]: Information Search and Retrieval--retrieval models, search process, selection process; H.3.5 [Information Storage and Retrieval]: Online Information Services--Web-based Services General Terms Algorithms, Languages, Design, Experimentation Keywords Web Services, Web Services Matching, WSDL, n-Spectrum Kernel, Ranking SVM

• Type: Conference
• Year: 2007
• Where: WWW
• Authors: Yu Jianjun, Guo Shengmin, Su Hao, Zhang Hui, Xu Ke
• Keywords: Internet Technology, Kernel Based Web, Keywords Web Services, N-spectrum Kernel Values, WWW 2007