Mining WWW Access Sequence by Matrix Clustering

Analysis of Users’ Web Navigation Behavior using GRPA with Variable Length Markov Chains

“…Smyth, [42] also developed a general sequence clustering approach, using hidden Markov models (HMMs). Another non-distance-based clustering method called matrix clustering was applied by Oyanagi et al, [22] to find sequential patterns in Web server logs. A new algorithm called the ''Ping-Pong" algorithm was used first to extract dense sub matrices from a binary matrix, in which each element indicates the occurrence of visits from one page to another.…”