The Best Trail Algorithm for Assisted Navigation of Web Sites

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
11 pages, 11 figures

Keywords

Data Structures and Algorithms, Information Retrieval, H.3.3;H.5.4;G.2.2;F.2.2

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/31668

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0306122
 http://arxiv.org/abs/cs/0306122

Collections

arXiv