Shapira, B.: Hypertext browsing : a new model for information filtering based on user profiles and data clustering (1996)
0.03
0.02569158 = product of:
0.07707474 = sum of:
0.07707474 = weight(_text_:wide in 4711) [ClassicSimilarity], result of:
0.07707474 = score(doc=4711,freq=2.0), product of:
0.22492146 = queryWeight, product of:
4.4307585 = idf(docFreq=1430, maxDocs=44218)
0.050763648 = queryNorm
0.342674 = fieldWeight in 4711, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.4307585 = idf(docFreq=1430, maxDocs=44218)
0.0546875 = fieldNorm(doc=4711)
0.33333334 = coord(1/3)
- Abstract
- Hypertext users often experience the so called 'lost in hyperspace' problem: where users experience disorientation stemming from too many jumps in the course of browsing through large databases. Proposes a filtering algorithm which is suitable for a wide spectrum of implementations and which restricts the amount of information available to the user; thus allowing improved hypertext browsing. An algorithm calculates the set of most relevant hypertext nodes for the user, utilizing the user profile and data clustering technique. The result is an optimal cluster of relevant data items, custom-tailored for each user's needs
