The Best Trail Algorithm for Assisted Navigation of Web Sites
<|reference_start|>The Best Trail Algorithm for Assisted Navigation of Web Sites: 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.<|reference_end|>
@article{wheeldon2003the,
    title={The Best Trail Algorithm for Assisted Navigation of Web Sites},
    author={Richard Wheeldon and Mark Levene},
    journal={arXiv preprint arXiv:cs/0306122},
    year={2003},
    archivePrefix={arXiv},
    eprint={cs/0306122},
    primaryClass={cs.DS cs.IR}
}