nMarkov chains and eigen-vector decomposition techniques
n
n
n
n
nA : matrix representing transition
probabilities
ns(t): probability vector for all the
states at time t
n
Use Markov chains model and
eigen-vector decomposition techniques to make Link prediction and path
analysis and to generate hubs
Sarukkai chose Markov
chains, which had been enormously successful in sequence matching/generation,
as mathematical model.
Sariukkai mentioned that the
key of navigation lied in ‘personalization’, and he believed that this
approach would lead to a satisfactory solution to navigating the huge World
Wide Web.
