Algorithm for Web Services Matching
暂无分享,去创建一个
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.
[1] B. Datta. Numerical Linear Algebra and Applications , 1995 .
[2] Yanchun Zhang,et al. Effectively Finding Relevant Web Pages from Linkage Information , 2003, IEEE Trans. Knowl. Data Eng..
[3] Martin F. Porter,et al. An algorithm for suffix stripping , 1997, Program.