Skip to main content

Using Similarity Measure to Enhance the Robustness of Web Access Prediction Model

  • Conference paper
Knowledge-Based Intelligent Information and Engineering Systems (KES 2005)

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

  • 1282 Accesses

Abstract

Prefetching web content by predicting users’ web requests can reduce the response time of the web server and optimize the network traffic. The Markov model that is based on the conditional probability has been studied by many researchers for web access path prediction. The prediction accuracy rate can reach up to 60 to 70 percent high. However a drawback of this type of model is that as the length of the access path grows the chance of successful path matching will decrease and the model will become inapplicable. In order to preserving the applicability as well as improving the accuracy rate, we extend the model by introducing a similarity measure among access paths. Therefore, the matching process becomes less rigid and the model will be more applicable and robust to the change of the path length.

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 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. Griffioen, J., Appleton, R.: Reducing file system latency using a predictive approach. In: Proc. USENIX Conference, Boston, Massachusetts, USA, pp. 8–12 (1994)

    Google Scholar 

  2. Padmanabhan, V.N., Mogul, J.C.: Using predictive prefetching to improve World Wide Web latency. ACM Computer Communication Review 27(3), 22–36 (1996)

    Article  Google Scholar 

  3. Pitkow, J., Pirolli, P.: Mining longest repeated subsequences to predict World Wide Web surfing. In: Second USENIX Symposium on Internet Technologies and Systems, Boulder, Colorado, USA, pp. 11–14 (1999)

    Google Scholar 

  4. Su, Z., Yang, Q., Lu, Y., Zhang, H.: WhatNext: A prediction system for web request using N-gram sequence models. In: First International Conference on Web Information Systems and Engineering Conference, Hong Kong, China, pp. 214–221 (2000)

    Google Scholar 

  5. Yang, Q., Zhang, H., Li, I.: Mining web logs for prediction models in WWW caching and prefetching. In: The Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining KDD 2001, San Francisco, California, USA, pp. 473–478 (2001)

    Google Scholar 

  6. Yang, Q., Zhang, H.: Web log mining for predictive web caching. IEEE Transactions on Knowledge and Data Engineering 15(4), 1050–1053 (2003)

    Article  Google Scholar 

  7. Pal, S.K., Shiu, S.C.K.: Foundations of Soft Case-Based Reasoning. John Wiley, Hoboken (2004)

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Niu, B., Shiu, S.C.K. (2005). Using Similarity Measure to Enhance the Robustness of Web Access Prediction Model. In: Khosla, R., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2005. Lecture Notes in Computer Science(), vol 3683. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11553939_16

Download citation

  • DOI: https://doi.org/10.1007/11553939_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28896-1

  • Online ISBN: 978-3-540-31990-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics