Skip to main content
SpringerLink
Log in

Algorithm for Web Services Matching

  • Conference paper
Advanced Web Technologies and Applications (APWeb 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3007))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Datta, B.N.: Numerical Linear Algebra and Application. Brooks/Cole Publishing Company, Monterey (1995)

    Google Scholar 

  2. Java Web Services, http://java.sun.com/webservices/

  3. Porter, M.F.: An algorithm for suffix stripping. Program 14(3), 130–137 (1980)

    Google Scholar 

  4. Publishing and Finding Web Services Using UDDI, http://edocs.bea.com/wls/docs70/webserv/uddi.html

  5. IBM UDDI Registry, http://uddi.ibm.com

  6. Hou, J., Zhang, Y.: Effectively Finding Relevant Web Pages from Linkage Information. IEEE Transactions on Knowledge Data Engineering 15(4), 940–951 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Technology, Deakin University, 221 Burwood Highway, Burwood, VIC, 3125, Australia

    Atul Sajjanhar & Jingyu Hou

  2. School of Computer Science and Mathematics, Victoria University, P O Box 14428, Melbourne, VIC, 8001, Australia

    Yanchun Zhang

Authors
  1. Atul Sajjanhar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jingyu Hou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yanchun Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Chinese University of Hong Kong, Hong Kong, China

    Jeffrey Xu Yu

  2. The University of News South Wales, NSW 2052, Australia

    Xuemin Lin

  3. Department of Computer Science, Tsinghua University, 100084, Beijing, P.R. China

    Hongjun Lu

  4. Victoria University, Australia

    Yanchun Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sajjanhar, A., Hou, J., Zhang, Y. (2004). Algorithm for Web Services Matching. In: Yu, J.X., Lin, X., Lu, H., Zhang, Y. (eds) Advanced Web Technologies and Applications. APWeb 2004. Lecture Notes in Computer Science, vol 3007. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24655-8_72

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24655-8_72

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21371-0

  • Online ISBN: 978-3-540-24655-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation