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.
History
Journal
Lecture notes in computer science
Volume
3007
Pagination
665 - 670
Location
Berlin, Germany
ISSN
0302-9743
eISSN
1611-3349
Language
eng
Notes
The original publication can be found at www.springerlink.com
Publication classification
C1 Refereed article in a scholarly journal; C Journal article