A Probabilistic Approach to Navigation in Hypertext

@article{citeulike:3017212, abstract = {One of the main unsolved problems confronting Hypertext is the navigation problem, namely the problem of having to know where you are in the database graph representing the structure of a Hypertext database, and knowing how to get to some other place you are searching for in the database graph. Previously we formalised a Hypertext database in terms of a directed graph whose nodes represent pages of information. The notion of a trail, which is a path in the database graph describing some logical ...}, author = {Levene, Mark and Loizou, George }, citeulike-article-id = {3017212}, comment = {Defines Hypertext Probabilistic Automata}, journal = {Information Sciences}, keywords = {clicks}, number = {1-4}, pages = {165--186}, posted-at = {2008-07-18 10:07:29}, priority = {0}, title = {A Probabilistic Approach to Navigation in Hypertext}, url = {http://citeseer.ist.psu.edu/levene99probabilistic.html}, volume = {114}, year = {1999} }

TY - JOUR ID - citeulike:3017212 L3 - citeulike-article-id:3017212 TI - A Probabilistic Approach to Navigation in Hypertext JF - Information Sciences VL - 114 IS - 1-4 SP - 165 EP - 186 N2 - One of the main unsolved problems confronting Hypertext is the navigation problem, namely the problem of having to know where you are in the database graph representing the structure of a Hypertext database, and knowing how to get to some other place you are searching for in the database graph. Previously we formalised a Hypertext database in terms of a directed graph whose nodes represent pages of information. The notion of a trail, which is a path in the database graph describing some logical ... KW - clicks N1 - Defines Hypertext Probabilistic Automata AU - Levene, Mark AU - Loizou, George PY - 1999/// UR - http://citeseer.ist.psu.edu/levene99probabilistic.html ER -