The Best Trail Algorithm for Assisted Navigation of Web Sites

Authors:
Richard Wheeldon;Mark Levene
Affiliations:
-;-
Venue:
LA-WEB '03 Proceedings of the First Conference on Latin American Web Congress
Year:
2003

Citing 0
Cited 10

Associating search and navigation behavior through log analysis: Research Articles

Journal of the American Society for Information Science and Technology
Navigationaided retrieval

Proceedings of the 16th international conference on World Wide Web
Modelling the navigation potential of a web page

Theoretical Computer Science
Web site topic-hierarchy generation based on link structure

Journal of the American Society for Information Science and Technology
Studying trailfinding algorithms for enhanced web search

Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval
Assessing the scenic route: measuring the value of search trails in web logs

Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval
Multiple vehicles for a semantic navigation across hyper-environments

ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications
What's the deal with the web/blogs/the next big technology: a key role for information science in e-social science research?

CoLIS'05 Proceedings of the 5th international conference on Context: conceptions of Library and Information Sciences
Building the trail best traveled: effects of domain knowledge on web search trailblazing

Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Task tours: helping users tackle complex search tasks

Proceedings of the 21st ACM international conference on Information and knowledge management

Quantified Score

Hi-index	0.00

Visualization

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.