ACM Home Page
Please provide us with feedback. Feedback
Selective Markov models for predicting Web page accesses
Full text PdfPdf (447 KB)
Source ACM Transactions on Internet Technology (TOIT) archive
Volume 4 ,  Issue 2  (May 2004) table of contents
Pages: 163 - 184  
Year of Publication: 2004
ISSN:1533-5399
Authors
Mukund Deshpande  University of Minnesota
George Karypis  University of Minnesota
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 26,   Downloads (12 Months): 149,   Citation Count: 19
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/990301.990304
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
4
 
5
 
6
Cooley, R., Tan, P.-N., and Srivastava, J. 1999. Websift: The web site information filter system. In Proceedings of the Web Usage Analysis and User Profiling Workshop.
 
7
 
8
 
9
Durbin, R., Eddy, S., Krogh, A., and G., M. 1998. Biological sequence analysis. Cambridge University Press.
10
 
11
Kohavi, R. and Brodley, C. 2000. Knowledge discovery and data mining cup SIGKDD 2000. http://www.ecn.purdue.edu/KDDCUP/.
12
 
13
Linton, F. 2000. Owl: A recommender system for organization-wide learning. J. Inter. Forum Educat. Tech. Soc.
14
 
15
Papoulis, A. 1991. Probability, Random Variables, and Stochastic Processes. McGraw Hill.
16
 
17
Pitkow, J. and Pirolli, P. 1999. Mining longest repeating subsequence to predict world wide web surfing. In 2nd USENIX Symposium on Internet Technologies and Systems. Boulder, CO.
 
18
 
19
Salzberg, S. L., Delcher, A. L., Kasif, S., and White, O. 1998. Microbial gene identification using interpolated markov models. Nucleic Acids Research.
 
20
 
21
 
22
Siu, M. and Ostendorf, M. 2000. Variable n-grams and extensions for conversational speech language modeling. IEEE Trans. Speech Audio Process. 8, 1 (Jan), 63--75.
23
 
24
Theusinger, C. and Huber, K.-P. 2000. Analyzing the footsteps of your customers. In WebKDD 2000.
25

CITED BY  19

Collaborative Colleagues:
Mukund Deshpande: colleagues
George Karypis: colleagues