Bottom-up faceted search: creating search neighbourhoods with datacube cells
RIS ID
105834
Abstract
Browsing a collection can start with a keyword search. A user visits a library, performs a keyword search to find a few books of interest; finding their location in the library. Then they go to these locations; the corresponding bookshelves, where they do not just retrieve the found books, but rather they start browsing the nearby books; the books which have a similar Dewey classification. This paper extends this approach to curated corpora that contain items or documents that have been classified in multiple dimensions (facets), where each dimension classification may be a hierarchy. In particular (i) a technique for determining near items based on OLAP datacube cells and (ii) user interfaces that support browsing of near items are presented.
Link to publisher version (URL)
Proceedings of the 24th ACM International Conference on Information and Knowledge Management
Publication Details
Sifer, M. (2015). Bottom-up faceted search: creating search neighbourhoods with datacube cells. Proceedings of the 24th ACM International Conference on Information and Knowledge Management (pp. 1771-1774). New York, United States: ACM.