A kernel based structure matching for web services search

Authors:
Yu Jianjun;Guo Shengmin;Su Hao;Zhang Hui;Xu Ke
Affiliations:
Beihang University, Beijing, China;Beihang University, Beijing, China;Beihang University, Beijing, China;Beihang University, Beijing, China;Beihang University, Beijing, China
Venue:
Proceedings of the 16th international conference on World Wide Web
Year:
2007

Citing 4
Cited 2

Algorithms on Trees and Graphs

Algorithms on Trees and Graphs
Searching XML documents via XML fragments

Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
Kernel Methods for Pattern Analysis

Kernel Methods for Pattern Analysis
Ranking definitions with supervised learning methods

WWW '05 Special interest tracks and posters of the 14th international conference on World Wide Web

Application of rough ensemble classifier to web services categorization and focused crawling

Web Intelligence and Agent Systems
Classification of web services using tensor space model and rough ensemble classifier

ISMIS'08 Proceedings of the 17th international conference on Foundations of intelligent systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a kernel based Web Services (abbrevi-ated as service) matching mechanism for service discoveryand integration. The matching mechanism tries to exploitthe 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 thefunctional similarity between services, whose parameters arelearned by a Ranking-SVM. The experiment results showedthat several metrics for the retrieval of services have beenimproved by our approach.