Hostname: page-component-cd9895bd7-dk4vv Total loading time: 0 Render date: 2024-12-28T23:05:58.529Z Has data issue: false hasContentIssue false

No zero match browsing of hierarchically categorized information entities

Published online by Cambridge University Press:  15 November 2002

CHRIS McMAHON
Affiliation:
Department of Mechanical Engineering, University of Bath, Bath BA2 7AY, United Kingdom
ROSE CROSSLAND
Affiliation:
Faculty of Engineering, University of Bristol, Bristol BS8 1TR, United Kingdom
ALISTAIR LOWE
Affiliation:
Department of Mechanical Engineering, University of Bath, Bath BA2 7AY, United Kingdom
TULAN SHAH
Affiliation:
Faculty of Engineering, University of Bristol, Bristol BS8 1TR, United Kingdom
JON SIMS WILLIAMS
Affiliation:
Faculty of Engineering, University of Bristol, Bristol BS8 1TR, United Kingdom
STEVE CULLEY
Affiliation:
Department of Mechanical Engineering, University of Bath, Bath BA2 7AY, United Kingdom

Abstract

The two main ways to search for information in electronic document collections are by using free-text retrieval search engines or browsing information that has been organized into predefined organizational structures. However, each of these approaches has limitations. Using word or phrase search, users are faced with a compromise between overly broad searches returning an excessive amount of information or overly narrow searches that may fail to return relevant information. Browsing organizational structures is dependent on the user's knowledge of the structures, and a user may find it difficult to refine searches. This paper introduces a user interface based approach to the browsing of hierarchically organized information entities that avoids these problems by allowing the incremental narrowing down of a set of search results and by pruning the organizational structure after each user selection to show the consequences of the selection. The effect is to present to the user at all times only that part of the organizational structure that will lead to a nonnull selection. The approach is called no zero match (NZM) browsing. The paper presents the computational basis of NZM browsing before describing a trial implementation of the approach and presenting three case studies, which represent common search situations in an engineering context.

Type
Research Article
Copyright
© 2002 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)