TY - GEN
T1 - Web path recommendations based on page ranking and Markov models
AU - Eirinaki, Magdalini
AU - Vazirgiannis, Michalis
AU - Kapogiannis, Dimitris
PY - 2005/12/1
Y1 - 2005/12/1
N2 - Markov models have been widely used for modelling users' navigational behaviour in the Web graph, using the transitional probabilities between web pages, as recorded in the web logs. The recorded users' navigation is used to extract popular web paths and predict current users' next steps. Such purely usage-based probabilistic models, however, present certain shortcomings. Since the prediction of users' navigational behaviour is based solely on the usage data, structural properties of the Web graph are ignored. Thus important - in terms of pagerank authority score - paths may be underrated. In this paper we present a hybrid probabilistic predictive model extending the properties of Markov models by incorporating link analysis methods. More specifically, we propose the use of a PageRank-style algorithm for assigning prior probabilities to the web pages based on their importance in the web site's graph. We prove, through experimentation, that this approach results in more objective and representative predictions than the ones produced from the pure usage-based approaches.
AB - Markov models have been widely used for modelling users' navigational behaviour in the Web graph, using the transitional probabilities between web pages, as recorded in the web logs. The recorded users' navigation is used to extract popular web paths and predict current users' next steps. Such purely usage-based probabilistic models, however, present certain shortcomings. Since the prediction of users' navigational behaviour is based solely on the usage data, structural properties of the Web graph are ignored. Thus important - in terms of pagerank authority score - paths may be underrated. In this paper we present a hybrid probabilistic predictive model extending the properties of Markov models by incorporating link analysis methods. More specifically, we propose the use of a PageRank-style algorithm for assigning prior probabilities to the web pages based on their importance in the web site's graph. We prove, through experimentation, that this approach results in more objective and representative predictions than the ones produced from the pure usage-based approaches.
KW - Link analysis
KW - Markov models
KW - PageRank
KW - Web personalization
U2 - 10.1145/1097047.1097050
DO - 10.1145/1097047.1097050
M3 - Conference contribution
AN - SCOPUS:79951734183
SN - 1595931945
SN - 9781595931948
T3 - Proceedings of the Interntational Workshop on Web Information and Data Management WIDM
SP - 2
EP - 9
BT - WIDM 2005 - Proceedings of the 7th ACM International Workshop on Web Information and Data Management, Co-located with CIKM 2005
T2 - 7th ACM International Workshop on Web Information and Data Management, WIDM 2005, Held in Conjunction with the International Conference on Information and Knowledge Management, CIKM 2005
Y2 - 5 November 2005 through 5 November 2005
ER -