Skip to main content

Part of the book series: Studies in Computational Intelligence ((SCI,volume 283))

Abstract

Web service technology is being applied to organizing business process in many large-scale enterprises. Discovery of composite service, therefore, has become an active research area. In this paper, we utilize a PLWAP-tree algorithm to analyze the relationship among web services from web service usage log. This method generates time-ordered sets of web services which can be exploited to integrate into a real business process. The empirical result shows the methodology is useful, flexible, and efficient. It is able to integrate web services into a composite service according to the mining result.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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. Agrawal, R., Gunopulos, D., Leymann, F.: Mining Process Models from Workflow Logs. In: Schek, H.-J., Saltor, F., Ramos, I., Alonso, G. (eds.) EDBT 1998. LNCS, vol. 1377, pp. 469–483. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  2. Gombotz, R., Dustdar, S.: On Web Services Workflow Mining. In: Proc. of the BPI Workshop (LNCS), pp. 216–228 (2006)

    Google Scholar 

  3. Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: Proc. ACM SIGMOD, pp. 1–12 (2000)

    Google Scholar 

  4. Lu, Y., Ezeife, C.I.: Position Coded Pre-Order Linked WAP-Tree for Web Log Sequential Pattern Mining. In: Proc. PAKDD, pp. 337–349 (2003)

    Google Scholar 

  5. Mobasher, B., Dai, H., Luo, T., Nakagawa, M.: Using Sequential and Non-Sequential Patterns in Predictive Web Usage Mining Tasks. In: Proc. ICDM, pp. 669–672 (2002)

    Google Scholar 

  6. Silva, R.: Zhang, Jiji., Shanahan, J.G.: Probabilistic Workflow Mining. In: Proc. ACM SIGKDD, pp. 275–284 (2005)

    Google Scholar 

  7. http://www.opentravel.org/

  8. http://www.w3.org/2001/sw

  9. http://www.w3.org/TR/soap

  10. http://www.w3.org/TR/wsdl

  11. http://www.uddi.org/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Wang, MF., Tsai, MF., Tang, CH., Hu, JY. (2010). Service Mining for Composite Service Discovery. In: Nguyen, N.T., Katarzyniak, R., Chen, SM. (eds) Advances in Intelligent Information and Database Systems. Studies in Computational Intelligence, vol 283. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12090-9_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-12090-9_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-12089-3

  • Online ISBN: 978-3-642-12090-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics