Adaptive hyperlinks using page access sequences and minimum spanning trees

Researchers have modelled existing hyperlink structure using graph theory. Such graph theoretical models have been useful for efficient Web navigation, especially for designing Web crawlers and search engines. This paper describes how sequence analysis of Web page accesses can be used to create weighted directed graphs. The information contained in such graphs can be used to improve the Web surfing experience. The paper proposes a concept of neighbourhood modelled after neighbourhood systems and rough sets to evaluate the effectiveness of navigation provided by a given hyperlink structure and Web usage data. Furthermore, a modification of the minimum spanning tree algorithm is used to create a hyperlink structure that provides optimal navigation.