The Best Trail Algorithm for Assisted Navigation of Web Sites

First Latin American Web Congress (LA-WEB'03) p. 166
The Best Trail Algorithm for Assisted Navigation of Web Sites
Richard Wheeldon, University of London
Mark Levene, University of London

Full Article Text:

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/LAWEB.2003.1250294
Send link to a friend

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 navigation opportunities.
Back to Top Additional Information
Citation: Richard Wheeldon, Mark Levene, "The Best Trail Algorithm for Assisted Navigation of Web Sites," la-web, p. 166, First Latin American Web Congress (LA-WEB'03), 2003

	Advanced Search
CS Search Google Search