Search results

1 – 1 of 1
To view the access options for this content please click here
Article
Publication date: 1 January 1996

Bracha Shapira, Peretz Shoval, Adi Raveh and Uri Hanani

Hypertext users often experience the ‘lost in hyperspace’ problem. This study suggests a solution which restricts the amount of information made available to the user…

Abstract

Hypertext users often experience the ‘lost in hyperspace’ problem. This study suggests a solution which restricts the amount of information made available to the user, thus allowing improved hypertext browsing. An algorithm calculates the set of most relevant hypertext nodes for the user, utilising the user profile and data clustering technique. The result is an optimal cluster of relevant data items, custom‐tailored for each user's needs.

Details

Online and CD-Rom Review, vol. 20 no. 1
Type: Research Article
ISSN: 1353-2642

1 – 1 of 1