Abstract
We present a computational simple and efficient approach to
unsupervised grouping the search result from any search engine. Along with each
group a set of keywords are found to annotate the contents. This
approach leads to an interactive search trough a hierarchial
structure that is build online. It is the users task to improve the search, trough expanding
the search query using the topic keywords representing the desired groups.
In doing so the search engine limits the space of possible search results, virtually moving down in the
search hierarchy, and so refines the search.
unsupervised grouping the search result from any search engine. Along with each
group a set of keywords are found to annotate the contents. This
approach leads to an interactive search trough a hierarchial
structure that is build online. It is the users task to improve the search, trough expanding
the search query using the topic keywords representing the desired groups.
In doing so the search engine limits the space of possible search results, virtually moving down in the
search hierarchy, and so refines the search.
| Original language | English |
|---|
| Publisher | Department of Mathematical Modelling, Technical University of Denmark |
|---|---|
| Publication status | Published - 2002 |