2004
DOI: 10.1007/978-3-540-24655-8_72
|View full text |Cite
|
Sign up to set email alerts
|

Algorithm for Web Services Matching

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 feas… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
43
0
2

Year Published

2006
2006
2023
2023

Publication Types

Select...
5
3
1

Relationship

1
8

Authors

Journals

citations
Cited by 54 publications
(45 citation statements)
references
References 2 publications
0
43
0
2
Order By: Relevance
“…The standardization of the web service description makes the discovery process easier [5]. Several approaches have been proposed to improve the accuracy of Web service discovery by applying several techniques like data mining [7] [6], singular vector decomposition [8], graph based methods, ontology based discovery frameworks, agent based and logic based methods.…”
Section: Issues With Traditional Semantic Web Service Discovery Servicesmentioning
confidence: 99%
“…The standardization of the web service description makes the discovery process easier [5]. Several approaches have been proposed to improve the accuracy of Web service discovery by applying several techniques like data mining [7] [6], singular vector decomposition [8], graph based methods, ontology based discovery frameworks, agent based and logic based methods.…”
Section: Issues With Traditional Semantic Web Service Discovery Servicesmentioning
confidence: 99%
“…Several Information Retrieval (IR) techniques have been proposed as a way to improve the efficacy of service matching in UDDI. Sajjanhar et al [4] have studied Latent Semantic Indexing (LSI), the prevailing method for small document collections, to capture the semantic associations between short textual advertisements of registered web services. Recently Corella et al [5] have developed a heuristic approach for the semi-automatic classification of web services, assuming that a corpus of previously classified services is available.…”
Section: Related Workmentioning
confidence: 99%
“…Wang and Stroulia in [2] employed the inverted file to index and search natural language description of desired services. Platzer and Dustdar in [3] also used the Vector Space Model (VSM) to implement a search engine for a Web service, and Sajjanhar et al have attempted to leverage Latent Semantic Analysis (LSA), a variant of VSM, for Web services discovery [4].…”
Section: Introductionmentioning
confidence: 99%