To read this content please select one of the options below:

HYPERTEXT BROWSING: A NEW MODEL FOR INFORMATION FILTERING BASED ON USER PROFILES AND DATA CLUSTERING

Bracha Shapira (Ben‐Gurion University of the Negev, Beer‐Sheva, Israel E‐mail: Bshapira@bgumail.bgu.ac.il)
Peretz Shoval (Ben‐Gurion University of the Negev, Beer‐Sheva, Israel)
Adi Raveh (Hebrew University, Jerusalem, Israel)
Uri Hanani (Hebrew University, Jerusalem, Israel)

Online and CD-Rom Review

ISSN: 1353-2642

Article publication date: 1 January 1996

91

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.

Citation

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/eb024556

Publisher

:

MCB UP Ltd

Copyright © 1996, MCB UP Limited

Related articles