The theory of concept (or Galois) lattices provides a simple and formal approach to conceptual clustering. In this paper we present GALOIS, a system that automates and applies this theory. The algorithm utilized by GALOIS to build a concept lattice is incremental and efficient, each update being done in time at most quadratic in the number of objects in the lattice. Also, the algorithm may incorporate background information into the lattice, and through clustering, extend the scope of the theory. The application we present is concerned with information retrieval via browsing, for which we argue that concept lattices may represent major support structures. We describe a prototype user interface for browsing through the concept lattice of a document-term relation, possibly enriched with a thesaurus of terms. An experimental evaluation of the system performed on a medium-sized bibliographic database shows good retrieval performance and a significant improvement after the introduction of background knowledge.
ER -
%0 Journal Article
%1 keyhere
%A Carpineto, Claudio
%A Romano, Giovanni
%D 1996
%J Machine Learning
%K analysis carpineto clustering concept fca formal information ir retrieval
%N 2
%P 95--122
%T A lattice conceptual clustering system and its application to browsing retrieval
%U http://dx.doi.org/10.1007/BF00058654
%V 24
%X The theory of concept (or Galois) lattices provides a simple and formal approach to conceptual clustering. In this paper we present GALOIS, a system that automates and applies this theory. The algorithm utilized by GALOIS to build a concept lattice is incremental and efficient, each update being done in time at most quadratic in the number of objects in the lattice. Also, the algorithm may incorporate background information into the lattice, and through clustering, extend the scope of the theory. The application we present is concerned with information retrieval via browsing, for which we argue that concept lattices may represent major support structures. We describe a prototype user interface for browsing through the concept lattice of a document-term relation, possibly enriched with a thesaurus of terms. An experimental evaluation of the system performed on a medium-sized bibliographic database shows good retrieval performance and a significant improvement after the introduction of background knowledge.
ER -
@article{keyhere,
abstract = {The theory of concept (or Galois) lattices provides a simple and formal approach to conceptual clustering. In this paper we present GALOIS, a system that automates and applies this theory. The algorithm utilized by GALOIS to build a concept lattice is incremental and efficient, each update being done in time at most quadratic in the number of objects in the lattice. Also, the algorithm may incorporate background information into the lattice, and through clustering, extend the scope of the theory. The application we present is concerned with information retrieval via browsing, for which we argue that concept lattices may represent major support structures. We describe a prototype user interface for browsing through the concept lattice of a document-term relation, possibly enriched with a thesaurus of terms. An experimental evaluation of the system performed on a medium-sized bibliographic database shows good retrieval performance and a significant improvement after the introduction of background knowledge.
ER -},
added-at = {2008-05-26T11:57:05.000+0200},
author = {Carpineto, Claudio and Romano, Giovanni},
biburl = {https://www.bibsonomy.org/bibtex/2a53905954aeef0a80ec7424f978bca14/stumme},
description = {SpringerLink - Zeitschriftenbeitrag},
interhash = {719ac1badf95acafafbd1487d82ae175},
intrahash = {a53905954aeef0a80ec7424f978bca14},
journal = {Machine Learning},
keywords = {analysis carpineto clustering concept fca formal information ir retrieval},
month = {#aug#},
number = 2,
pages = {95--122},
timestamp = {2008-05-26T11:57:05.000+0200},
title = {A lattice conceptual clustering system and its application to browsing retrieval},
url = {http://dx.doi.org/10.1007/BF00058654},
volume = 24,
year = 1996
}