M. Huchard, H. Dicky and H. Leblanc. Galois lattice as a framework to specify building class hierarchies algorithms. Theoretical Informatics and Applications, 34:521-548, 2000.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... learning has been extensively investigated [31, 8] and in particular searching abstractions space prior to investigate more expressive concep spaces [12] Galois connections and Galois lattices have been widely used in various elds concerning Data and Knowledge representation and organization [14, 19, 17]. A Galois lattice is a well de ned and exhaustive representation of the concepts embedded in a data set. Various techniques have been proposed to represent the Galois lattice and reduce its size by eliminating part of the nodes [15, 16] Still the main drawback of this structure is that the size ....

....have the attribute modem communication type valued. Indeed, most of the laptops have a modem in this catalog. Insert gure 8 about here. 5 Related work Galois connections and Galois lattices have been widely used in various elds concerning data and knowledge representation and organisation [14, 19, 17]. In most contributions E is the set of parts of an instance set I and L is the set of parts of a property set A (see Example 1) However recent work in Knowledge Representation and Machine Learning investigates more complex languages. For instance in [22] Galois lattices as representations of ....

M. Huchard, H. Dicky, and H. Leblanc. Galois lattice as a framework to specify building class hierarchies algorithms. In Theoretical Informatics and Applications, EDP Sciences, n. 34, pages 521-548, 2000.

....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 paradigm for describing and understanding concept lattices, by equating the closed sets of the lattice with the set of minimal separators ....

M. Huchard, H. Dicky and H. Leblanc. Galois lattice as a framework to specify building class hierarchies algorithms Theoretical Informatics and Applications, 34:521548, (2000).

.... and Ganter s work have introduced new perspectives and applications, and the use of concept lattices is rapidly emerging in many areas related to Artificial Intelligence and Data Mining, such as Data Base Management, Machine Learning, and Frequent Set Generation (see e.g. 24] 23] 22] 18] [14]) The main drawback of concept lattices is that they may be of exponential size. This makes it impossible, in practise, to compute and span the entire structure they describe. It is thus of primeval importance to be able to navigate the lattice efficiently, or to be able to define a polynomial ....

M. Huchard, H. Dicky and H. Leblanc. Galois lattice as a framework to specify building class hierarchies algorithms. Theoretical Informatics and Applications, 34:521--548, 2000.

.... 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 frequent item sets ( 23] machine learning ( 15] 17] and the reorganization of object hierarchies ([13], 5] The main drawback to this approach is that a concept lattice is, in general, of exponential size. As a consequence, it is of primary importance to be able to generate concepts eciently, even when only part of the lattice is explored. Concept generation has given rise to a steady ow of ....

M. Huchard, H. Dicky and H. Leblanc. Galois lattice as a framework to specify building class hierarchies algorithms. Theoretical Informatics and Applications, 34:521-548, 2000.

....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 mining for biological databases. In this paper, we present a new paradigm for describing and understanding concept lattices, ....

M. Huchard, H. Dicky and H. Leblanc. Galois lattice as a framework to specify building class hierarchies algorithms. Theoretical Informatics and Applications, 34:521548, 2000.

No context found.

M. Huchard, H. Dicky and H. Leblanc. Galois lattice as a framework to specify building class hierarchies algorithms. Theoretical Informatics and Applications, 34:521-548, 2000.

No context found.

M. Huchard, H. Dicky and H. Leblanc. Galois lattice as a framework to specify building class hierarchies algorithms. Theoretical Informatics and Applications 34 (2000) 521548.

No context found.

M. Huchard, H. Dicky and H. Leblanc. Galois lattice as a framework to specify building class hierarchies algorithms. Theoretical Informatics and Applications, 34:521-548, 2000.

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