Titlebook: Concept Lattices and Their Applications; Fourth International Sadok Ben Yahia,Engelbert Mephu Nguifo,Radim Beloh Conference proceedings 200

胰脏

Closure Systems of Equivalence Relations and Their Labeled Class Geometriestexts and is categorically equivalent to the notion of a closed system of equivalence relations (SER). This specialization step enables us to give conditions under which the complete affine ordered set can be interpreted as the set of congruence classes labeled with the congruence relation they stem

乞丐

Generalizations of Approximable Concept Latticezzification of the classical crisp concept lattice. One of them was shown by R. Bĕlohlávek : concept lattice in fuzzy setting. The second one was given by S. Kraj.i: generalized concept lattice. On the other hand, as a generalization of concept, Zhang, P. Hitzler, Shen defined the notion of approxim

准则

Rule Validation of a Meta-classifier Through a Galois (Concept) Lattice and Complementary Meanss a . that is both predictive and descriptive. This meta-classifier is made of a set of classification rules, which can be refined then validated. The refinement step, proposes to remove from the meta-classifier rules that according to their confidence coefficient, computed by statistical means, wou

规章

Graded LinClosure and Its Role in Relational Data Analysisns. It can also be used together with graded extension of Ganter’s . algorithm to compute non-redundant bases of data tables with fuzzy attributes. We present foundations, the algorithm, and illustrative examples.

怒目而视

Yet Another Approach for Completing Missing Valuesy removed during the pre-processing step of the KDD process. Starting from the fact that ”making up this missing data is better than throwing it away”, we present a new approach trying to complete the missing data. The main singularity of the introduced approach is that it sheds light on a fruitful

乞丐

冷漠

Galois Lattices and Bases for MGK-Valid Association Ruleseasures used in the data mining literature, and which enables to handle negative association rules. On the other hand, we characterize bases for M.-valid association rules in terms of a closure operator induced by a Galois connection. Thus, these bases can be derived from a Galois lattice, as do wel

执拗

STRIA

Concept Lattice Representations of Annotated Taxonomiestext consistent with a given annotated ordered set, their concept lattice representations are derived. We develop the fundamental mathematical relations present in this formulation, in particular deriving a conceptual pre-ordering of the taxonomy, and constructing a correspondence between the annota

Preserve

An Algorithm to Find Frequent Concepts of a Formal Context with Taxonomyxonomy exists, existing techniques produce a completed context with all attributes deduced from the taxonomy. Usual algorithms can then be applied on the completed context for finding frequent concepts, but the results systematically contain redundant information. This article describes an algorithm