Infinite mixtures of Markov chains

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Facilitating a satisfying user experience requires a detailed understanding of user behavior and intentions. The key is to leverage observations of activities, usually the clicks performed on Web pages. A common approach is to transform user sessions into Markov chains and analyze them using mixture models. However, model selection and interpretability of the results are often limiting factors. As a remedy, we present a Bayesian nonparametric approach to group user sessions and devise behavioral patterns. Empirical results on a social network and an electronic text book show that our approach reliably identifies underlying behavioral patterns and proves more robust than baseline competitors.

Cite

CITATION STYLE

APA

Reubold, J., Boubekki, A., Strufe, T., & Brefeld, U. (2018). Infinite mixtures of Markov chains. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10785 LNAI, pp. 167–181). Springer Verlag. https://doi.org/10.1007/978-3-319-78680-3_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free