Nothing Special   »   [go: up one dir, main page]

Skip to main content

Predicting Web Requests Efficiently Using a Probability Model

  • Conference paper
Advances in Knowledge Discovery and Data Mining (PAKDD 2004)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3056))

Included in the following conference series:

  • 3058 Accesses

Abstract

As the world-wide-web grows rapidly and a user’s browsing experiences are needed to be personalized, the problem of predicting a user’s behavior on a web-site has become important. We present a probability model to utilize path profiles of users from web logs to predict the user’s future requests. Each of the user’s next probable requests is given a conditional probability value, which is calculated according to the function presented by us. Our model can give several predictions ranked by the values of their probability instead of giving one, thus increasing recommending ability. The experiments show that our algorithm and model has a good performance. The result can potentially be applied to a wide range of applications on the web.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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.

Similar content being viewed by others

References

  1. Pei, J., Han, J., Zhu, H., Mortazavi-asl, B.: Mining Access Patters Efficiently from Web Logs. In: Terano, T., Chen, A.L.P. (eds.) PAKDD 2000. LNCS, vol. 1805, pp. 396–407. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  2. Srivasta, J., Cooley, R., Deshpande, M., Tan, P.: Web Usage Mining: Discovery and Applications of Usage Patterns from Web Data. SIGKDD Explorations 2(1) (2000)

    Google Scholar 

  3. Joachirms, T., Freitag, D., Mitchell, T.: WebWatcher. A Tour Guide for the World Wide Web. In: Proceedings of 15th International Joint Conference on Artificial Intelligence, August 1997, pp. 770–775. Morgan Kaufmann, San Francisco (1997)

    Google Scholar 

  4. Pazzani, M., Muramatsu, J., Billsus, D.: Syskill&Webert: Identifying interesting web sites. In: Proceedings of the 13th National Conference on Artificial Intelligence, Portland (1996)

    Google Scholar 

  5. Masseglia, F., Poncelet, P., Teisseire, M.: Using Data Mining Techniques on Web Access Logs to Dynamically Improve Hypertext Structure. ACM Sib Web Letters 8(3), 13–19 (1999)

    Google Scholar 

  6. Sarukkai, R.R.: Link Prediction and Path Analysis Using Markov Chains. In: the 9th International WWW Conference (2000)

    Google Scholar 

  7. http://kdd.ics.uci.edu/databases/msweb/msweb.html

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wu, S., Wang, W. (2004). Predicting Web Requests Efficiently Using a Probability Model. In: Dai, H., Srikant, R., Zhang, C. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2004. Lecture Notes in Computer Science(), vol 3056. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24775-3_67

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24775-3_67

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-24775-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics