Are web users really Markovian?

WWW'12 - Proceedings of the 21st Annual Conference on World Wide Web

Volumn , Issue , 2012, Pages 609-618

  Chierichetti, Flavio ^a   Kumar, Ravi ^b   Raghavan, Prabhakar ^b   Sarlós, Tamás ^b  

^a School of Operations Research and Information Engineering   (United States)

^b YAHOO RESEARCH   (United States)

Author keywords

Browsing behavior; Markov chains; User models

Indexed keywords

BROWSING BEHAVIOR; MARKOVIAN; ORDER ESTIMATION; PAGERANK; USER MODELING; USER MODELS; WEB SETTINGS; WEB USERS;

BEHAVIORAL RESEARCH; MATHEMATICAL MODELS; WEBSITES;

MARKOV PROCESSES;

EID: 84860858325     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2187836.2187919     Document Type: Conference Paper

References (22)

1. N. Archak, V. Mirrokni, and S. Muthukrishnan. Mining advertiser-specific user behavior using adfactors. In 19th WWW, 2010.
2. P. Boldi, F. Bonchi, C. Castillo, D. Donato, A. Gionis, and S. Vigna. The query-flow graph: Model and applications. In 17th CIKM, 2008.
3. J. Borges and M. Levene. Evaluating variable-length Markov chain models for analysis of user web navigation sessions. IEEE TKDE, 2007.
4. P. Buhlmann and A. Wyner. Variable length Markov chains. Annals of Statistics, 1999.
5. H. Cao, D. Jiang, J. Pei, E. Chen, and H. Li. Towards context-aware search by learning a very large variable length hidden Markov model from search logs. In 18th WWW, 2009.
6. N. Craswell and M. Szummer. Random walks on the click graph. In 30th SIGIR, 2007.
7. I. Csiszár and P. Shields. The consistency of the BIC Markov order estimator. Annals of Statistics, 2000.
8. D. Dalevi, D. Dubhashi, and M. Hermansson. A new order estimator for fixed and variable length Markov models with applications to DNA sequence similarity. Statistical Applications in Genetics and Molecular Biology, 2006.
9. B. Davison. Learning web request patterns. Web Dynamics, 2004.
10. M. Deshpande and G. Karypis. Selective Markov models for predicting web page accesses. ACM TOIT, 2004.
11. I. Holyer. The NP-completeness of some edge-partition problems. SICOMP, 1981.
12. J. Kemeny and J. Snell. Finite Markov Chains. van Nostrand, 1960.
13. R. Lempel and S. Moran. SALSA: The stochastic approach for link-structure analysis. ACM TOIS, 2001.
14. Z. Li and J. Tian. Testing the suitability of Markov chains as web usage models. In COMPSAC 2003, 2003.
15. L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank citation ranking: Bringing order to the web. Technical report, Stanford InfoLab, 1999.
16. Y. Peres and P. Shields. Two new Markov order estimators. Arxiv Preprint Math/0506080, 2005.
17. P. Pirolli and J. Pitkow. Distributions of surfers'paths through the World Wide Web: Empirical characterizations. WWW, 1999.
18. J. Rissanen. A universal data compression system. IEEE Trans. on Inf. Theory, 1983.
19. D. Ron, Y. Singer, and N. Tishby. The power of amnesia: Learning probabilistic automata with variable memory length. Machine Learning, 1996.
20. R. Sarukkai. Link prediction and path analysis using Markov chains. Computer Networks, 2000.
21. R. Sen and M. Hansen. Predicting web users'next access based on log data. JCGS, 2003.
22. I. Zukerman, D. Albrecht, and A. Nicholson. Predicting users'requests on the WWW. In 7th UM, 1999.