We present an algorithm called the Best Trail Algorithm, which helps solve the hypertext navigation problem by automating the construction of memex-like trails through the corpus. The algorithm performs a probabilistic best-first expansion of a set of navigation trees to find relevant and compact trails. We describe the implementation of the algorithm, scoring methods for trails, filtering algorithms and a new metric called potential gain which measures the potential of a page for future...
%0 Generic
%1 citeulike:100336
%A Wheeldon, Richard
%A Levene, Mark
%B Proceedings of the 1st Latin American Web Congress (LA-WEB'03)
%D 2003
%K memex trails
%T The Best Trail Algorithm for Assisted Navigation Of Web
%U http://citeseer.ist.psu.edu/692435.html
%X We present an algorithm called the Best Trail Algorithm, which helps solve the hypertext navigation problem by automating the construction of memex-like trails through the corpus. The algorithm performs a probabilistic best-first expansion of a set of navigation trees to find relevant and compact trails. We describe the implementation of the algorithm, scoring methods for trails, filtering algorithms and a new metric called potential gain which measures the potential of a page for future...
@misc{citeulike:100336,
abstract = {We present an algorithm called the Best Trail Algorithm, which helps solve the hypertext navigation problem by automating the construction of memex-like trails through the corpus. The algorithm performs a probabilistic best-first expansion of a set of navigation trees to find relevant and compact trails. We describe the implementation of the algorithm, scoring methods for trails, filtering algorithms and a new metric called potential gain which measures the potential of a page for future...},
added-at = {2006-10-19T17:52:23.000+0200},
author = {Wheeldon, Richard and Levene, Mark},
biburl = {https://www.bibsonomy.org/bibtex/204d04e7c3db77ac7567e87880b046760/gridinoc},
booktitle = {Proceedings of the 1st Latin American Web Congress (LA-WEB'03)},
citeulike-article-id = {100336},
interhash = {d9e2664e37bb80402bf8c472886e4f7e},
intrahash = {04d04e7c3db77ac7567e87880b046760},
keywords = {memex trails},
priority = {2},
timestamp = {2006-10-19T17:52:23.000+0200},
title = {The Best Trail Algorithm for Assisted Navigation Of Web},
url = {http://citeseer.ist.psu.edu/692435.html},
year = 2003
}