Selective Markov models for predicting Web page accesses
- 1 May 2004
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Internet Technology
- Vol. 4 (2), 163-184
- https://doi.org/10.1145/990301.990304
Abstract
The problem of predicting a user's behavior on a Web site has gained importance due to the rapid growth of the World Wide Web and the need to personalize and influence a user's browsing experience. Markov models and their variations have been found to be well suited for addressing this problem. Of the different variations of Markov models, it is generally found that higher-order Markov models display high predictive accuracies on Web sessions that they can predict. However, higher-order models are also extremely complex due to their large number of states, which increases their space and run-time requirements. In this article, we present different techniques for intelligently selecting parts of different order Markov models so that the resulting model has a reduced state complexity, while maintaining a high predictive accuracy.Keywords
This publication has 8 references indexed in Scilit:
- KDD-Cup 2000 organizers' reportACM SIGKDD Explorations Newsletter, 2000
- Link prediction and path analysis using Markov chainsComputer Networks, 2000
- Web usage miningACM SIGKDD Explorations Newsletter, 2000
- Authoritative sources in a hyperlinked environmentJournal of the ACM, 1999
- Biological Sequence AnalysisPublished by Cambridge University Press (CUP) ,1998
- Microbial gene identification using interpolated Markov modelsNucleic Acids Research, 1998
- The power of amnesia: Learning probabilistic automata with variable memory lengthMachine Learning, 1997
- Using predictive prefetching to improve World Wide Web latencyACM SIGCOMM Computer Communication Review, 1996