Sequential activity profiling: Latent dirichlet allocation of Markov chains

Data Mining and Knowledge Discovery

Volumn 10, Issue 3, 2005, Pages 175-196

  Girolami, Mark ^a   Kabán, Ata ^b  

^a UNIVERSITY OF GLASGOW   (United Kingdom)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

Markov chains; Mixture models; User profiling

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; WEB BROWSERS; WORLD WIDE WEB;

MIXTURE MODELS; SEQUENTIAL ACTIVITIES; USER PROFILLING;

MARKOV PROCESSES;

EID: 22044450174     PISSN: 13845810     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10618-005-0362-2     Document Type: Article

References (26)

1. Anderson, C., Domingos, P., and Weld, D. 2001. Adaptive web navigation for wireless devices. In Proceedings of the 17th International Joint Conference on Artificial Intelligence, pp. 879-884.
2. Attias, H. 2001. Learning in high dimension: modular mixture models. In Proc. AI and Statistics.
3. Blei, D.M., Ng, A.Y., and Jordan, M.I. 2003. Latent dirchlet allocation. Journal of Machine Learning Research, 3(5):993-1022.
4. Borges, J. and Levene, M. 1999. Data mining of user navigation patterns. WEBKDD, pp. 92-111.
5. Cadez, I., Heckerman, D., Meek, C., Smyth, P., and White, S. 2003. Model-based clustering and visualisation of navigation patterns on a web site. Journal of data Mining and Knowledge Discovery, 7(4):399-424.
6. Cover, T.M and Thomas, J.A. 1991. Elements of Information Theory. New York: Wiley.
7. Deshpande, M. and Karypis. to appear. Selective markov models for predicting web-page accesses. ACM Transactions on Internet Technology.
8. Hofmann, T. 2001. Unsupervised learning by probabilistic latent semantic analysis. Machine Learning, 42:177-196.
9. Hofmann, T. 2001. Learning What People (Don't) Want. In European Conference on Machine Learning, pp. 214-225.
10. Frydman, H. 1984. Maximum likelihood estimation in the mover-stayer model. Journal of the American Statistical Society, 79:632-638.
11. Krogh, A. Hidden Markov Models in computational biology: Applications to protein modelling. Journal of Molecular Biology, 235:1501-1531.
12. Lee, D. and Sebastian Seung, H. 2001. Algorithms for Non-negative Matrix Factorization. In Advances in Neural Information Processing Systems 13, Todd K. Leen, Thomas G. Dietterich, and Volker. Tresp, (eds.) MIT Press, pp. 556-562.
13. Linton, F., Joy, D., Schaefer, H.-P. and Charron, A. 2000. OWL: A recommender system for organization-wide learning. Educational Technology & Society, 3.
14. Mannila, H., and Rusakov, D. 2001. Decomposing event sequences into independent components. In First SIAM Conference on Data Mining.
15. Manning, C.D. and Schütze, H. 1999. Foundations of Statistical Natural Language Processing. Cambridge, Massachusetts: The MIT Press.
16. Minka, T. and Lafferty, J. 2002. Expectation-propogation for the generative aspect model. In Proceedings of the Eighteenth Conference on Uncertainty in Artificial Intelligence.
17. Mitchell, T. 1996. Machine Learning. New York, US: McGraw-Hill.
18. Rabiner, L.R. 1989. A tutorial on hidden Markov models and selected applications in speech recognition. In Proc. of the IEEE, 77(2):257-285.
19. Raftery, A. 1985. A model for higher-order Markov chains. Journal of the Royal Statistical Society B, 47(3):528-539.
20. Ronning, G. 1989. Maximum likelihood estimation of Dirichlet distributions. Journal of Statistical Computation and Simulation, 32(4):215-221.
21. Ross, D.A. and Zemel, R.S. 2003. Multiple-cause vector quantiztion. In Advances in Neural Information Processing Systems 15, S. Becker, S. Thrun and K. Obermayer (Eds.), MIT Press, pp. 1017-1024.
22. Sarukkai, R. 2000. Link prediction and path analysis using markov chains. Computer Networks, 33(1-6):377-386.
23. Saul, L. and Pereira, F. 1997. Aggregate and mixed-order markov models for statistical language processing. In Proceedings of 2nd International Conference on Empirical Methods in Natural Language Processing, pp. 81-89.
24. Saul, L.K. and Jordan, M.I. 1999. Mixed memory markov models: Decomposing complex stochastic processes as mixtures of simpler ones. Machine Learning, 37:75-87.
25. Tino, P. and Dorffner, G. 2001. Predicting the future of discrete sequences from fractal representations of the past. Machine Learning, 45(2): 187-218.
26. Lappalainen, H. and Miskin, J.W. 2000. Ensemble learning. In Advances in Independent Component Analysis, M. Girolami (Ed.). Springer-Verlag, pp. 75-92.