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, customtailored for each user's needs.
Online and CD-Rom Review – Emerald Publishing
Published: Jan 1, 1996