Many websites have a hierarchical organization of content. This organization may be quite different from the organization expected by visitors to the website. In particular, it is often unclear where a specific document is located. In this paper, we propose an algorithm to automatically find pages in a website whose location is different from where visitors expect to find them. The key insight is that visitors will backtrack if they do not find the information where they expect it: the point from where they backtrack is the expected location for the page. We present an algorithm for discovering such expected locations that can handle page caching by the browser. Expected locations with a significant number of hits are then presented to the website administrator. We also present algorithms for selecting expected locations (for adding navigation links) to optimize the benefit to the website or the visitor. We ran our algorithm on the Wharton business school website and found that even on this small website, there were many pages with expected locations different from their actual location.
[1]
Cyrus Shahabi,et al.
Knowledge discovery from users Web-page navigation
,
1997,
Proceedings Seventh International Workshop on Research Issues in Data Engineering. High Performance Database Management for Large-Scale Applications.
[2]
Philip S. Yu,et al.
Data mining for path traversal patterns in a web environment
,
1996,
Proceedings of 16th International Conference on Distributed Computing Systems.
[3]
Jian Pei,et al.
Mining Access Patterns Efficiently from Web Logs
,
2000,
PAKDD.
[4]
WebUsersMyra Spiliopoulou,et al.
A Data Miner analyzing the Navigational Behaviour of
,
1999
.
[5]
Hiroki Kato,et al.
Discovering the gap between Web site designers' expectations and users' behavior
,
2000,
Comput. Networks.
[6]
Oren Etzioni,et al.
Towards adaptive Web sites: Conceptual framework and case study
,
2000,
Artif. Intell..
[7]
Oren Etzioni,et al.
Adaptive Web Sites: Automatically Synthesizing Web Pages
,
1998,
AAAI/IAAI.