%0 Conference Paper %1 eirinaki2005recommendations %A Eirinaki, Magdalini %A Vazirgiannis, Michalis %A Kapogiannis, Dimitris %B International Workshop on Web Information and Data Management %C New York, NY, USA %D 2005 %I ACM %K analysis chain diss inthesis markov model navigational page prediction rank %P 2--9 %R 10.1145/1097047.1097050 %T Web Path Recommendations Based on Page Ranking and Markov Models %U http://doi.acm.org/10.1145/1097047.1097050 %X 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. %@ 1-59593-194-5

@inproceedings{eirinaki2005recommendations, abstract = {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.}, acmid = {1097050}, added-at = {2017-01-29T15:52:32.000+0100}, address = {New York, NY, USA}, author = {Eirinaki, Magdalini and Vazirgiannis, Michalis and Kapogiannis, Dimitris}, biburl = {https://www.bibsonomy.org/bibtex/293633606a7ae6a0c989d826fcab2fb12/becker}, booktitle = {International Workshop on Web Information and Data Management}, doi = {10.1145/1097047.1097050}, interhash = {fa133db8d3631f266ee047fd71ca3be5}, intrahash = {93633606a7ae6a0c989d826fcab2fb12}, isbn = {1-59593-194-5}, keywords = {analysis chain diss inthesis markov model navigational page prediction rank}, location = {Bremen, Germany}, numpages = {8}, pages = {2--9}, publisher = {ACM}, series = {WIDM '05}, timestamp = {2017-12-20T17:11:15.000+0100}, title = {Web Path Recommendations Based on Page Ranking and Markov Models}, url = {http://doi.acm.org/10.1145/1097047.1097050}, year = 2005 }