Experimental comparison of navigation in a Galois lattice with conventional information retrieval methods

doi:10.1006/imms.1993.1035

International Journal of Man-Machine Studies

Volume 38, Issue 5, May 1993, Pages 747-767

https://doi.org/10.1006/imms.1993.1035 Get rights and content

Abstract

A controlled experiment was conducted comparing information retrieval using a Galois lattice structure with two more conventional retrieval methods: navigating in a manually built hierarchical classification and Boolean querying with index terms. No significant performance difference was found between Boolean querying and the Galois lattice retrieval method for subject searching with the three measures used for the experiment: user searching time, recall and precision. However, hierarchical classification retrieval did show significantly lower recall compared to the other two methods. This experiment suggests that retrieval using a Galois lattice structure may be an attractive alternative since it combines a good performance for subject searching along with browsing potential.

References (0)

Cited by (101)

A lattice-based approach for chemical structural retrieval
2015, Engineering Applications of Artificial Intelligence
Citation Excerpt :
Godin et al. (1989) developed a textual information retrieval system based on a term-document lattice. The proposed system was compared with other retrieval methods and found that its performance is better than hierarchical classification (Godin et al., 1993). Cheung and Vogel (2005) proposed to apply Formal Concept Analysis to transform a term-document matrix to a formal context of a lattice, and map each document to an object and each term to an attribute.
Searching for chemical structures with similar structural and functional information of organic chemicals is an important part of the drug discovery process. However, the current chemical structural retrieval methods have focused mainly on finding chemicals with similar structures to the input chemical structural query, and tend to ignore the functional features which are important for determining the chemical property and activity of the chemicals. In this paper, we propose a lattice-based approach for chemical structural retrieval. The proposed lattice-based approach is based on Formal Concept Analysis. It retrieves chemical structures that have functional groups and interactions between functional groups similar to the chemical structural query. The performance of the proposed lattice-based approach is evaluated and its promising performance results have shown that the proposed approach is effective for chemical structural retrieval.
Formal query systems on contexts and a representation of algebraic lattices
2013, Information Sciences
Citation Excerpt :
In this aspect, much effort has been made to enhance the FCA-based approaches for IR. For instance, Godin et al. [19] showed that browsing and query formulation can be combined into the FCA-based retrieval paradigm for a unique retrieval space including both terms and documents. Carpineto and Romano [7] developed a system named REFINER based on Galois lattices to conduct the refinement and enlargement of the user-initiated queries.
Formal Concept Analysis (FCA) has proven to be a feasible framework for information retrieval (IR). In this paper, with the aim of exploring the mathematical properties of the FCA-based document retrieval paradigm, we propose the notions of conjunctive and disjunctive query on the formal contexts and investigate the derived query systems from the order-theoretical perspective. We show that the conjunctive query system is isomorphic to the Galois lattice of the underlying context, while the disjunctive query system can be join-densely generated from the Galois lattice of the underlying context up to isomorphism. Next, we introduce directed disjunctive query systems and study their connection with algebraic lattices. As a result, we show that the notion of directed disjunctive query provides an alternative approach to restructuring algebraic lattices.
Concept lattice reduction using fuzzy K-Means clustering
2010, Expert Systems with Applications
During the design of concept lattices, complexity plays a major role in computing all the concepts from the huge incidence matrix. Hence for reducing the size of the lattice, methods based on matrix decompositions like SVD are available in the literature. However, SVD computation is known to have large time and memory requirements. In this paper, we propose a new method based on Fuzzy K-Means clustering for reducing the size of the concept lattices. We demonstrate the implementation of proposed method on two application areas: information retrieval and information visualization.
Bit-Close: a fast incremental concept calculation method
2024, Applied Intelligence
Conceptual Navigation in Large Knowledge Graphs
2022, Complex Data Analytics with Formal Concept Analysis
Knowledge Reduction in Formal Contexts through CUR Matrix Decomposition
2019, Cybernetics and Systems

View all citing articles on Scopus

View full text

Regular ArticleExperimental comparison of navigation in a Galois lattice with conventional information retrieval methods

Abstract

Regular Article
Experimental comparison of navigation in a Galois lattice with conventional information retrieval methods