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 feasibility of the algorithm. |
Year | DOI | Venue |
---|---|---|
2004 | 10.1007/978-3-540-24655-8_72 | ADVANCED WEB TECHNOLOGIES AND APPLICATIONS |
Keywords | Field | DocType |
singular value decomposition,web service,linear algebra | Data mining,Semantic Web Stack,WS-Addressing,Computer science,Web standards,Data Web,WS-I Basic Profile,Algorithm,Web modeling,Social Semantic Web,Web service,Database | Conference |
Volume | ISSN | Citations |
3007 | 0302-9743 | 40 |
PageRank | References | Authors |
2.31 | 3 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Atul Sajjanhar | 1 | 154 | 19.00 |
Jingyu Hou | 2 | 181 | 16.93 |
Yanchun Zhang | 3 | 3059 | 284.90 |