Open AccessBook Chapter10.1007/978-3-540-24655-8_72

Algorithm for Web Services Matching

- 14 Apr 2004

- pp 665-670

TL;DR: The proposed algorithm is based on singular value decomposition in linear algebra, which reveals semantic relationships among web services, and the preliminary evaluation shows the effectiveness and feasibility of the algorithm.

Abstract: UDDI is a standard for publishing and discovery of web services. UDDI registries provide keyword searches for web services. The search functionality is very simple and fails to account for relationships between web services. In this paper, we propose an algorithm which retrieves closely related web services. The proposed algorithm is based on singular value decomposition (SVD) in linear algebra, which reveals semantic relationships among web services. The preliminary evaluation shows the effectiveness and feasibility of the algorithm.

AI Agents for this Paper

Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps

Most frequently asked questions

1. What are the contributions in this paper?

In this paper, the authors propose an algorithm which retrieves closely related web services.

2. What are the future works in this paper?

In the future, the authors plan to make available a web service which will accept keywords to perform searches in the UDDI registry.. This is also planned in their future research.

Table 1. Percentages of G2 services in the matched service sets for some G1 services with Non-SVD algorithm and SVD-Based algorithm

Citations

Web Service Discovery Mechanisms: Looking for a Needle in a Haystack?

John Garofalakis, +3 more

- 01 Jan 2004

TL;DR: This paper reviews the latest methods, architectures, models and concerns that have arisen in the Web Service domain in the last five years.

...read moreread less

111

•Proceedings Article•10.1145/1361482.1361487

Efficiently finding web services using a clustering semantic approach

Jiangang Ma, +2 more

- 22 Apr 2008

TL;DR: Inspired by the success of partitioning approach used in the database design, a novel clustering semantic algorithm was used to eliminate irrelevant services with respect to a query and Probabilistic Latent Semantic Analysis (PLSA) was utilized to capture the semantics hidden behind the words in a query, and the descriptions in the services, so that service matching can be carried out at the concept level.

...read moreread less

Journal Article•10.1016/J.FUTURE.2010.04.012

Web services discovery and rank: An information retrieval approach

Yanan Hao, +2 more

- 01 Oct 2010

- Future Generation Computer Systems

TL;DR: A novel IR-Style mechanism for discovering and ranking web services automatically, given a textual description of desired services is proposed, and various algorithms are given for computing the relevance and importance of services, respectively.

...read moreread less

Web services discovery based on schema matching

Yanan Hao, +1 more

- 30 Jan 2007

TL;DR: This paper proposes a new schema matching algorithm for supporting web-service operations matching, which catches not only structures, but also semantic information of schemas of services.

...read moreread less

•Proceedings Article•10.1109/SITIS.2007.17

Searching Services "on the Web": A Public Web Services Discovery Approach

Chen Wu, +1 more

- 16 Dec 2007

TL;DR: This paper provides a simple-to-use yet effective Web service discovery mechanism that can retrieve relevant Web services directly from the Internet to suffice various requirements.

...read moreread less

...

Expand

References

Journal Article•10.1108/EB046814

An algorithm for suffix stripping

M. F. Porter

- 01 Dec 1997

- Program: Electronic Library and Informat...

TL;DR: An algorithm for suffix stripping is described, which has been implemented as a short, fast program in BCPL, and performs slightly better than a much more elaborate system with which it has been compared.

...read moreread less

9.1K

•Book

Numerical Linear Algebra and Applications

Biswa Nath Datta

- 30 Jan 1995

TL;DR: A review of some Required Concepts from Core Linear Algebra and some useful Transformations in Numerical LinearAlgebra and Their Applications.

...read moreread less

723

•Journal Article•10.1109/TKDE.2003.1209010

Effectively finding relevant Web pages from linkage information

Jingyu Hou, +1 more

- 01 Jul 2003

- IEEE Transactions on Knowledge and Data ...

TL;DR: Two hyperlink analysis-based algorithms to find relevant pages for a given Web page (URL) that take advantage of linear algebra theories to reveal deeper relationships among the Web pages and to identify relevant pages more precisely and effectively are presented.

...read moreread less

Algorithm for Web Services Matching

Chat with Paper

AI Agents for this Paper

Most frequently asked questions

1. What are the contributions in this paper?

2. What are the future works in this paper?

Figures

Citations

Web Service Discovery Mechanisms: Looking for a Needle in a Haystack?

Efficiently finding web services using a clustering semantic approach

Web services discovery and rank: An information retrieval approach

Web services discovery based on schema matching

Searching Services "on the Web": A Public Web Services Discovery Approach

References

An algorithm for suffix stripping

Numerical Linear Algebra and Applications

Effectively finding relevant Web pages from linkage information

Related Papers (5)

Similarity search for web services

A vector space search engine for Web services

A vector space model for automatic indexing

Modern Information Retrieval

Semantic Structure Matching for Assessing Web-Service Similarity