DocumentCode :
2359925
Title :
The best trail algorithm for assisted navigation of Web sites
Author :
Wheeldon, Richard ; Levene, Mark
Author_Institution :
Sch. of Comput. Sci. & Inf. Syst., London Univ., UK
fYear :
2003
fDate :
10-12 Nov. 2003
Firstpage :
166
Lastpage :
178
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.
Keywords :
Web sites; computational complexity; hypermedia; tree searching; Web site; best trail algorithm; filtering algorithm; hypertext navigation problem; potential gain metric; probabilistic best-first expansion; scoring method; Computer science; Educational institutions; Filtering algorithms; Gain measurement; Hypertext systems; Information systems; Motion planning; Navigation; Topology; Web sites;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Web Congress, 2003. Proceedings. First Latin American
Print_ISBN :
0-7695-2058-8
Type :
conf
DOI :
10.1109/LAWEB.2003.1250294
Filename :
1250294
Link To Document :
بازگشت