Generating dynamic higher-order Markov models in web usage mining
Borges, J. and Levene, Mark (2005) Generating dynamic higher-order Markov models in web usage mining. In: Jorge, A.M. and Torgo, L. and Brazdil, P. and Camacho, R. and Gama, J. (eds.) Knowledge Discovery in Databases: PKDD 2005. Lecture Notes in Computer Science 3721. Berlin, Germany: Springer, pp. 34-45. ISBN 9783540292449.
Markov models have been widely used for modelling users’ web navigation behaviour. In previous work we have presented a dynamic clustering-based Markov model that accurately represents second-order transition probabilities given by a collection of navigation sessions. Herein, we propose a generalisation of the method that takes into account higher-order conditional probabilities. The method makes use of the state cloning concept together with a clustering technique to separate the navigation paths that reveal differences in the conditional probabilities. We report on experiments conducted with three real world data sets. The results show that some pages require a long history to understand the users choice of link, while others require only a short history. We also show that the number of additional states induced by the method can be controlled through a probability threshold parameter.
|Item Type:||Book Section|
|School:||Birkbeck Schools and Departments > School of Business, Economics & Informatics > Computer Science and Information Systems|
|Research Centre:||Birkbeck Knowledge Lab|
|Depositing User:||Sandra Plummer|
|Date Deposited:||17 Jan 2006|
|Last Modified:||02 Dec 2016 13:23|
Additional statistics are available via IRStats2.