File(s) under permanent embargo
Algorithm for web services matching
journal contribution
posted on 2004-01-01, 00:00 authored by Atul SajjanharAtul Sajjanhar, Jingyu HouJingyu Hou, Y ZhangUDDI 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 scienceVolume
3007Pagination
665 - 670Publisher
Springer-VerlagLocation
Berlin, GermanyPublisher DOI
ISSN
0302-9743eISSN
1611-3349Language
engNotes
The original publication can be found at www.springerlink.comPublication classification
C1 Refereed article in a scholarly journal; C Journal articleCopyright notice
2004, Springer-VerlagUsage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC