Information retrieval through hybrid navigation of lattice representations

Abstract

Summary. In this paper we present a comprehensive approach to automatic organization and hybrid navigation of text databases. An organizing stage first builds a particular lattice representation of the data, through text indexing followed by lattice clustering of the indexed texts. The lattice representation, then, supports the navigation stage of the system, a visual retrieval interface that combines three main retrieval strategies: browsing, querying, and bounding. Browsing and querying are used to search the retrieval space, bounding is used to restrict it based on the information that users have, or get during their interaction with the system. We show that such a hybrid paradigm permits high flexibility in trading off information exploration and retrieval and, in addition, has good retrieval performance. We compared information retrieval using lattice-based hybrid navigation with conventional Boolean querying. The results of an experiment conducted on two medium-sized bibliographic databases showed that the performance of lattice retrieval was comparable to or better than Boolean retrieval.

Effective reformulation of Boolean queries with concept lattices

“…• The application of concept lattices to information retrieval has been explored by [11] and [5]. These systems build the concept lattice associated with a document/term relation and then employ various methods to access the relevant information, including the possibility for the user to search only those terms that the user has specified [5].…”

“…These systems build the concept lattice associated with a document/term relation and then employ various methods to access the relevant information, including the possibility for the user to search only those terms that the user has specified [5]. These systems, however, are severely affected by their computational requirements: since they build an entire concept lattices, they can only be applied to databases of modest size, where each document is described by a small number of index terms.…”

“…By contrast, REFINER builds only a relevant portion of the lattice, and therefore allows full-text indexing even for reasonablysized databases. Furthermore, REFINER combines the potentials of lattice-based inspection with the great expressive power of Boolean retrieval, while the query mode of the systems described in [11] and [5] is inherently limited.…”

PERMUTING TRI-f-DERIVATIONS IN LATTICES

“…Lattices play an important role in many fields such as information theory, information retrieval, information access conrols and cryptanalysis ( [2], [6], [20]). Recently the properties of lattices were widely researched ( [1], [2], [5], [10], [12], [20], [22]).…”

Computing Intensions of Digital Library Collections

“…[19]). The structuring of information that FCA supports has inspired work on browsing [15,6], clustering [7], and ranking [9,18]. A basic drawback of these approaches is that they require the computation of the whole concept lattice, whose size may be exponential in that of the context, as it is well-known.…”