Using Markov Chains for link prediction in adaptive web sites
http://data.open.ac.uk/oro/2963
is a Article , Section

Outgoing links

Property Object
Creator
Dataset Open Research Online
Publisher Springer
At Soft Ware 2002: First International Conference on Computing in an Imperfect World
Date 2002
Is part of repository
Status Peer reviewed
URI
  • http://data.open.ac.uk/oro/document/17888
  • http://data.open.ac.uk/oro/document/18596
  • http://data.open.ac.uk/oro/document/240
  • http://data.open.ac.uk/oro/document/7200
Volume 2311
Abstract The large number of Web pages on many Web sites has raised navigational problems. Markov chains have recently been used to model user navigational behavior on the World Wide Web (WWW). In this paper, we propose a method for constructing a Markov model of a Web site based on past visitor behavior. We use the Markov model to make link predictions that assist new users to navigate the Web site. An algorithm for transition probability matrix compression has been used to cluster Web pages with similar transition behaviors and compress the transition matrix to an optimal size for efficient probability calculation in link prediction. A maximal forward path method is used to further improve the efficiency of link prediction. Link prediction has been implemented in an online system called ONE (Online Navigation Explorer) to assist users' navigation in the adaptive Web site.
Authors authors
Editors editors
Type
Label Zhu, Jianhan ; Hong, Jun and Hughes, John G. (2002). Using Markov Chains for link prediction in adaptive web sites. In: Bustard, D.; Sterritt, W. and Liu, R. eds. Soft-Ware 2002: Computing in an Imperfect World : First International Conference, Soft-Ware 2002 Belfast, Northern Ireland, April 8-10, 2002. Proceedings. Lecture Notes in Computer Science, 2311. Springer, pp. 60–73.
Title Using Markov Chains for link prediction in adaptive web sites