M. Barbut and B. Monjardet. Ordre et classi cation. Classiques Hachette, 1970. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Representing a Concept Lattice By a Graph - Berry, Sigayret (2002) (Correct)
....to de ne a sublattice, decompose a binary relation, and enumerate the elements of the lattice. 1 Introduction One of the important challenges in data handling is generating or navigating the concept lattice of a binary relation. Concept lattices are well studied as a classi cation tool (see [1]) are used in several areas of Database Managing, as studying Object Oriented Databases (see [28] inheritance lattices (see [14] and generating frequent sets, and are a promising aid for the rapidly emerging eld of data mining for biological databases. In this paper, we present a new ....
M. Barbut and B. Monjardet. Ordre et classi cation. Classiques Hachette 1970.
Efficient Concept Generation - Berry, Bordat, Sigayret (Correct)
....in the base is to compute all possible combinations of elements of the relation into maximal rectangles. These rectangles, called concepts, are organized into a hierarchical structure called a concept lattice. This theory, though studied by mathematicians as far back as the Nineteenth Century (see [1], 10] was made popular and developed by Wille and his team ( 10] and remains one of the important current trends of research in Data Mining and Arti cial Intelligence: concept lattices are used in elds as varied as the discovery of association rules in Data Bases ( 24] the generation of ....
M. Barbut and B. Monjardet. Ordre et classi cation. Classiques Hachette, 1970.
Representing a Concept Lattice By a Graph - Berry, Sigayret (2002) (Correct)
....to de ne a sublattice, decompose a binary relation, and enumerate the elements of the lattice. 1 Introduction One of the important challenges in data handling is generating or navigating the concept lattice of a binary relation. Concept lattices are well studied as a classi cation tool (see [1]) are used in several areas of Database Managing, such as Object Oriented Databases (see [40] inheritance lattices (see [19] mining for association rules (see [41] 30] and in Data Mining for generating frequent sets (see [39] and are a promising aid for the rapidly emerging eld of data ....
M. Barbut and B. Monjardet. Ordre et classi cation. Classiques Hachette, 1970.
Maintaining Class Membership Information - Berry, Sigayret (2002) (Correct)
No context found.
M. Barbut and B. Monjardet. Ordre et classi cation. Classiques Hachette, 1970.
Concept Lattices and Undirected Graphs - Berry (2004) (Correct)
No context found.
M. Barbut and B. Monjardet. Ordre et classi cation. Classiques Hachette (1970).
Representing a Concept Lattice By a Graph - Berry, Sigayret (2004) (Correct)
No context found.
M. Barbut and B. Monjardet. Ordre et classi cation. Classiques Hachette (1970).
Concepts Can't Afford to Stammer - Berry, Bordat, Sigayret (Correct)
No context found.
M. Barbut and B. Monjardet. Ordre et classi cation. Classiques Hachette, 1970.
Weaving through a Crowd of Minimal Separators - Berry (2003) (Correct)
No context found.
M. Barbut and B. Monjardet. Ordre et classi cation. Classiques Hachette, 1970.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC