pith. sign in

arxiv: cs/0406032 · v1 · submitted 2004-06-17 · 💻 cs.IR · cs.AI

A Dynamic Clustering-Based Markov Model for Web Usage Mining

classification 💻 cs.IR cs.AI
keywords methodmarkovdynamicmodelclusteringclustering-basedconceptin-links
0
0 comments X
read the original abstract

Markov models have been widely utilized for modelling user web navigation behaviour. In this work we propose a dynamic clustering-based method to increase a Markov model's accuracy in representing a collection of user web navigation sessions. The method makes use of the state cloning concept to duplicate states in a way that separates in-links whose corresponding second-order probabilities diverge. In addition, the new method incorporates a clustering technique which determines an effcient way to assign in-links with similar second-order probabilities to the same clone. We report on experiments conducted with both real and random data and we provide a comparison with the N-gram Markov concept. The results show that the number of additional states induced by the dynamic clustering method can be controlled through a threshold parameter, and suggest that the method's performance is linear time in the size of the model.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.