 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
| n |
Longest
Repeating Subsequence Model
|
|
|
[Pitkow 99]
|
|
|
|
n |
Surfing paths
can be represented as n-grams <X1,
|
|
|
X2,…Xn> to indicate sequences of page clicks by a
|
|
population of
users visiting a web site
|
|
|
|
n |
Find Longest
repeating subsequence
|
|
|
|
n |
E.g., 135 in
15135213544
|
|
|
|
n |
Match the
performance accuracy of the one-hop
|
|
|
Markov model
while reducing the complexity by
|
|
|
nearly 33%
|
|