Hypertext browsing: A new model for information filtering based on user profiles and data clustering

Bracha Shapira; Peretz Shoval; Adi Raveh; Uri Hanani

doi:10.1108/eb024556

Hypertext browsing: A new model for information filtering based on user profiles and data clustering

Bracha Shapira, Peretz Shoval, Adi Raveh, Uri Hanani

Department of Software and Information Systems Engineering

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

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.

Original language	English
Pages (from-to)	3-9
Number of pages	7
Journal	Online and CDROM Review
Volume	20
Issue number	1
DOIs	https://doi.org/10.1108/eb024556
State	Published - 1 Jan 1996

ASJC Scopus subject areas

General Engineering

Access to Document

10.1108/eb024556

Cite this

@article{3028aa88b60b41968a0d07e434890052,

title = "Hypertext browsing: A new model for information filtering based on user profiles and data clustering",

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.",

author = "Bracha Shapira and Peretz Shoval and Adi Raveh and Uri Hanani",

year = "1996",

month = jan,

day = "1",

doi = "10.1108/eb024556",

language = "English",

volume = "20",

pages = "3--9",

journal = "Online and CDROM Review",

issn = "1353-2642",

publisher = "Emerald Group Publishing Ltd.",

number = "1",

}

TY - JOUR

T1 - Hypertext browsing

T2 - A new model for information filtering based on user profiles and data clustering

AU - Shapira, Bracha

AU - Shoval, Peretz

AU - Raveh, Adi

AU - Hanani, Uri

PY - 1996/1/1

Y1 - 1996/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0030080898&partnerID=8YFLogxK

U2 - 10.1108/eb024556

DO - 10.1108/eb024556

M3 - Article

AN - SCOPUS:0030080898

SN - 1353-2642

VL - 20

SP - 3

EP - 9

JO - Online and CDROM Review

JF - Online and CDROM Review

IS - 1

ER -

Hypertext browsing: A new model for information filtering based on user profiles and data clustering

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this