A Rough Set-Aided System for Sorting WWW Bookmarks
R. Jensen, and Q. Shen. WI '01: Proceedings of the First Asia-Pacific Conference on Web Intelligence: Research and Development, page 95--105. London, UK, Springer-Verlag, (2001)
Abstract
Most people store 'bookmarks' to web pages. These allow the user to return to a web page later on, without having to remem- ber the exact URL address. People attempt to organise their bookmark databases by filing bookmarks under categories, themselves arranged in a hierarchical fashion. As the maintenance of such large repositories is diffcult and time-consuming, a tool that automatically categorises book- marks is required. This paper investigates how rough set theory can help extract information out of this domain, for use in an experimental auto- matic bookmark classification system. In particular, work on rough set dependency degrees is applied to reduce the otherwise high dimensional- ity of the feature patterns used to characterize bookmarks. A compari- son is made between this approach to data reduction and a conventional entropy-based approach.
%0 Conference Paper
%1 jensen2001rough
%A Jensen, Richard
%A Shen, Qiang
%B WI '01: Proceedings of the First Asia-Pacific Conference on Web Intelligence: Research and Development
%C London, UK
%D 2001
%I Springer-Verlag
%K studienarbeit closely_related
%P 95--105
%T A Rough Set-Aided System for Sorting WWW Bookmarks
%U jensen01.ps
%X Most people store 'bookmarks' to web pages. These allow the user to return to a web page later on, without having to remem- ber the exact URL address. People attempt to organise their bookmark databases by filing bookmarks under categories, themselves arranged in a hierarchical fashion. As the maintenance of such large repositories is diffcult and time-consuming, a tool that automatically categorises book- marks is required. This paper investigates how rough set theory can help extract information out of this domain, for use in an experimental auto- matic bookmark classification system. In particular, work on rough set dependency degrees is applied to reduce the otherwise high dimensional- ity of the feature patterns used to characterize bookmarks. A compari- son is made between this approach to data reduction and a conventional entropy-based approach.
@inproceedings{jensen2001rough,
abstract = {Most people store 'bookmarks' to web pages. These allow the user to return to a web page later on, without having to remem- ber the exact URL address. People attempt to organise their bookmark databases by filing bookmarks under categories, themselves arranged in a hierarchical fashion. As the maintenance of such large repositories is diffcult and time-consuming, a tool that automatically categorises book- marks is required. This paper investigates how rough set theory can help extract information out of this domain, for use in an experimental auto- matic bookmark classification system. In particular, work on rough set dependency degrees is applied to reduce the otherwise high dimensional- ity of the feature patterns used to characterize bookmarks. A compari- son is made between this approach to data reduction and a conventional entropy-based approach.},
added-at = {2011-01-28T11:35:00.000+0100},
address = {London, UK},
author = {Jensen, Richard and Shen, Qiang},
biburl = {https://www.bibsonomy.org/bibtex/20648bf26cc33bdd7fd218b00db0e2511/dbenz},
booktitle = {WI '01: Proceedings of the First Asia-Pacific Conference on Web Intelligence: Research and Development},
file = {jensen2001rough.pdf:jensen2001rough.pdf:PDF},
interhash = {1543f43c9580c9537d3891f4e38073b8},
intrahash = {0648bf26cc33bdd7fd218b00db0e2511},
keywords = {studienarbeit closely_related},
lastdatemodified = {2005-08-06},
lastname = {Jensen},
own = {own},
pages = {95--105},
pdf = {jensen01.pdf},
publisher = {Springer-Verlag},
read = {read},
timestamp = {2013-07-31T15:39:42.000+0200},
title = {A Rough Set-Aided System for Sorting WWW Bookmarks},
url = {jensen01.ps},
year = 2001
}