Sciweavers

10 search results - page 1 / 2
» Concept Lattices under Non-commutative Conjunctors Are Gener...
Sort
View
EUSFLAT
2007
145views Fuzzy Logic» more  EUSFLAT 2007»
13 years 6 months ago
Concept Lattices under Non-commutative Conjunctors Are Generalized Concept Lattices
Generalized concept lattices have been recently proposed to deal with uncertainty or incomplete information as a non-symmetric generalization of the theory of fuzzy formal concept...
Jesús Medina, Manuel Ojeda-Aciego, Jorge Ru...
ISCI
2010
96views more  ISCI 2010»
13 years 3 months ago
Multi-adjoint t-concept lattices
The t-concept lattice is introduced as a set of triples associated to graded tabular information interpreted in a non-commutative fuzzy logic. Following the general techniques of ...
Jesús Medina, Manuel Ojeda-Aciego
ICCS
2005
Springer
13 years 10 months ago
Merge-Based Computation of Minimal Generators
Abstract. Minimal generators (mingens) of concept intents are valuable elements of the Formal Concept Analysis (FCA) landscape, which are widely used in the database field, for da...
Céline Frambourg, Petko Valtchev, Robert Go...
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 5 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
CLA
2007
13 years 6 months ago
An FDP-Algorithm for Drawing Lattices
In this work we want to discuss an algorithm for drawing line diagrams of lattices based on force directed placement (FDP). This widely used technique in graph drawing introduces f...
Christian Zschalig