skip to main content
10.1145/2187836.2187919acmotherconferencesArticle/Chapter ViewAbstractPublication PageswwwConference Proceedingsconference-collections
research-article

Are web users really Markovian?

Published:16 April 2012Publication History

ABSTRACT

User modeling on the Web has rested on the fundamental assumption of Markovian behavior --- a user's next action depends only on her current state, and not the history leading up to the current state. This forms the underpinning of PageRank web ranking, as well as a number of techniques for targeting advertising to users. In this work we examine the validity of this assumption, using data from a number of Web settings. Our main result invokes statistical order estimation tests for Markov chains to establish that Web users are not, in fact, Markovian. We study the extent to which the Markovian assumption is invalid, and derive a number of avenues for further research.

References

  1. P. Boldi, F. Bonchi, C. Castillo, D. Donato, A. Gionis, and S. Vigna. The query-flow graph: Model and applications. In 17th CIKM, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. J. Borges and M. Levene. Evaluating variable-length Markov chain models for analysis of user web navigation sessions. IEEE TKDE, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. P. Buhlmann and A. Wyner. Variable length Markov chains. Annals of Statistics, 1999.Google ScholarGoogle Scholar
  4. 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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. N. Craswell and M. Szummer. Random walks on the click graph. In 30th SIGIR, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. I. Csiszár and P. Shields. The consistency of the BIC Markov order estimator. Annals of Statistics, 2000.Google ScholarGoogle Scholar
  7. 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.Google ScholarGoogle ScholarCross RefCross Ref
  8. B. Davison. Learning web request patterns. Web Dynamics, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  9. M. Deshpande and G. Karypis. Selective Markov models for predicting web page accesses. ACM TOIT, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. I. Holyer. The NP-completeness of some edge-partition problems. SICOMP, 1981.Google ScholarGoogle ScholarCross RefCross Ref
  11. J. Kemeny and J. Snell. Finite Markov Chains. van Nostrand, 1960.Google ScholarGoogle Scholar
  12. R. Lempel and S. Moran. SALSA: The stochastic approach for link-structure analysis. ACM TOIS, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Z. Li and J. Tian. Testing the suitability of Markov chains as web usage models. In COMPSAC 2003, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank citation ranking: Bringing order to the web. Technical report, Stanford InfoLab, 1999.Google ScholarGoogle Scholar
  15. Y. Peres and P. Shields. Two new Markov order estimators. Arxiv Preprint Math/0506080, 2005.Google ScholarGoogle Scholar
  16. P. Pirolli and J. Pitkow. Distributions of surfers' paths through the World Wide Web: Empirical characterizations. WWW, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. J. Rissanen. A universal data compression system. IEEE Trans. on Inf. Theory, 1983.Google ScholarGoogle Scholar
  18. D. Ron, Y. Singer, and N. Tishby. The power of amnesia: Learning probabilistic automata with variable memory length. Machine Learning, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. R. Sarukkai. Link prediction and path analysis using Markov chains. Computer Networks, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. R. Sen and M. Hansen. Predicting web users' next access based on log data. JCGS, 2003.Google ScholarGoogle ScholarCross RefCross Ref
  21. I. Zukerman, D. Albrecht, and A. Nicholson. Predicting users' requests on the WWW. In 7th UM, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Are web users really Markovian?

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Other conferences
        WWW '12: Proceedings of the 21st international conference on World Wide Web
        April 2012
        1078 pages
        ISBN:9781450312295
        DOI:10.1145/2187836

        Copyright © 2012 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 16 April 2012

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        Overall Acceptance Rate1,899of8,196submissions,23%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader