Algorithm for web services matching


Autoria(s): Sajjanhar, Atul; Hou, Jingyu; Zhang, Yanchun
Data(s)

01/01/2004

Resumo

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.<br />

Identificador

http://hdl.handle.net/10536/DRO/DU:30002381

Idioma(s)

eng

Publicador

Springer-Verlag

Relação

http://dro.deakin.edu.au/eserv/DU:30002381/hou-algorithmforwebservices-2004.pdf

http://dro.deakin.edu.au/eserv/DU:30002381/n20040132.pdf

http://dx.doi.org/10.1007/b96838

Direitos

2004, Springer-Verlag

Tipo

Journal Article