First Latin American Web Congress (LA-WEB'03) The Best Trail Algorithm for Assisted Navigation of Web Sites Santiago, Chile November 10-November 12 ISBN: 0-7695-2058-8
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 navigation opportunities.
Citation:
Richard Wheeldon, Mark Levene, "The Best Trail Algorithm for Assisted Navigation of Web Sites," la-web, pp.166, First Latin American Web Congress (LA-WEB'03), 2003 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||