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.
Shapira, B., Shoval, P., Raveh, A. and Hanani, U. (1996), "HYPERTEXT BROWSING: A NEW MODEL FOR INFORMATION FILTERING BASED ON USER PROFILES AND DATA CLUSTERING", Online and CD-Rom Review, Vol. 20 No. 1, pp. 3-10. https://doi.org/10.1108/eb024556Download as .RIS
MCB UP Ltd
Copyright © 1996, MCB UP Limited