The Best Trail Algorithm for Assisted Navigation of Web Sites

Simple item page
dc.creatorWheeldon, Richard
dc.creatorLevene, Mark
dc.date2003-06-22
dc.date.accessioned2026-07-07T03:19:57Z
dc.date.available2026-07-07T03:19:57Z
dc.descriptionWe 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.
dc.description11 pages, 11 figures
dc.identifierhttps://arxiv.org/abs/cs/0306122
dc.identifierhttp://arxiv.org/abs/cs/0306122
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31668
dc.subjectData Structures and Algorithms
dc.subjectInformation Retrieval
dc.subjectH.3.3;H.5.4;G.2.2;F.2.2
dc.titleThe Best Trail Algorithm for Assisted Navigation of Web Sites
dc.typetext

Files

Collections

arXiv