The Best Trail Algorithm for Assisted Navigation of Web Sites
Data Structures and Algorithms
2007-05-23 v1 Information Retrieval
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 \emph{potential gain} which measures the potential of a page for future navigation opportunities.
Cite
@article{arxiv.cs/0306122,
title = {The Best Trail Algorithm for Assisted Navigation of Web Sites},
author = {Richard Wheeldon and Mark Levene},
journal= {arXiv preprint arXiv:cs/0306122},
year = {2007}
}
Comments
11 pages, 11 figures