Skip to main navigation Skip to search Skip to main content

A kernel based structure matching for web services search

  • Yu Jianjun*
  • , Guo Shengmin
  • , Su Hao
  • , Zhang Hui
  • , Xu Ke
  • *Corresponding author for this work
  • Beihang University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publication16th International World Wide Web Conference, WWW2007
Pages1249-1250
Number of pages2
DOIs
StatePublished - 2007
Event16th International World Wide Web Conference, WWW2007 - Banff, AB, Canada
Duration: 8 May 200712 May 2007

Publication series

Name16th International World Wide Web Conference, WWW2007

Conference

Conference16th International World Wide Web Conference, WWW2007
Country/TerritoryCanada
CityBanff, AB
Period8/05/0712/05/07

Keywords

  • N-spectrum kernel
  • Ranking SVM
  • WSDL
  • Web services
  • Web services matching

Fingerprint

Dive into the research topics of 'A kernel based structure matching for web services search'. Together they form a unique fingerprint.

Cite this