scispace - formally typeset
Search or ask a question

Showing papers by "Hao Su published in 2007"


Proceedings ArticleDOI
11 Mar 2007
TL;DR: The evaluation showed that the SNet system performs considerable service discovery efficiency, and to guarantee efficient and semantic service discovery, SNet schemes WSDL-S as Semantic Web Services description language and extracts its semantic attributes as indexing keys in Skip Graph.
Abstract: This paper presents the design of SNet system, which is a P2P overlay for Semantic Web Services discovery. SNet differs from previous P2P Web Services discovery systems in that it supports complex search with its locality-preserving feature based on Skip Graph. To guarantee efficient and semantic service discovery, SNet schemes WSDL-S as Semantic Web Services description language and extracts its semantic attributes as indexing keys in Skip Graph so that similar keys are aggregated to keep the leverage between peer nodes. Our evaluation showed that the SNet system performs considerable service discovery efficiency.

16 citations


Journal ArticleDOI
Kai Nan, Jianjun Yu1, Hao Su1, Shengmin Guo1, Hui Zhang1, Ke Xu1 
TL;DR: In this paper, Web Services are schemed by WSDL (Web Services Description Language) as tree-structured XML documents, and their matching degree is calculated by a novel algorithm designed for loosely tree matching against the traditional methods.
Abstract: This paper describes a kernel methods based Web Services matching mechanism for Web Services discovery and integration. The matching mechanism tries to exploit the latent semantics by the structure of Web Services. In this paper, Web Services are schemed by WSDL (Web Services Description Language) as tree-structured XML documents, and their matching degree is calculated by our novel algorithm designed for loosely tree matching against the traditional methods. In order to achieve the task, we bring forward the concept of path subsequence to model WSDL documents in the vector space. Then, an advanced n-spectrum kernel function is defined, so that the similarity of two WSDL documents can be drawn by implementing the kernel function in the space. 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 Web Services, whose parameters are learned by a ranking-SVM. Finally, a set of experiments were designed to verify the model, and the results showed that several metrics for the retrieval of Web Services have been improved by our approach.

2 citations