## Formal Concept Analysis: 4th International Conference, ICFCA 2006, Dresden, Germany, Feburary 13-17, 2006, ProceedingsThis book constitutes the refereed proceedings of the 4th International Conference on Formal Concept Analysis, held in February 2006. The 17 revised full papers presented together with four invited papers were carefully reviewed and selected for inclusion in the book. The papers show advances in applied lattice and order theory and in particular scientific advances related to formal concept analysis and its practical applications: data and knowledge processing including data visualization, information retrieval, machine learning, data analysis and knowledge management. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Methods of Conceptual Knowledge Processing | 1 |

An Enumeration Problem in Ordered Sets Leads to Possible Benchmarks for RunTime Prediction Algorithms | 30 |

Attribute Implications in a Fuzzy Setting | 45 |

The Assessment of Knowledge in Theory and in Practice | 61 |

The Basic Theorem on Preconcept Lattices | 80 |

The Tensor Product as a Lattice of Regular Galois Connections | 89 |

Two Instances of Peirces Reduction Thesis | 105 |

Very Fast Instances for Concept Generation | 119 |

About the Family of Closure Systems Preserving Nonunit Implications in the GuiguesDuquenne Base | 191 |

Spatial Indexing for Scalability in FCA | 205 |

Homograph Disambiguation Using Formal Concept Analysis | 221 |

Using Concept Lattices to Uncover Causal Dependencies in Software | 233 |

An FCA Interpretation of Relation Algebra | 248 |

SpringBased Lattice Drawing Highlighting Conceptual Similarity | 264 |

Characterizing Planar Lattices Using LeftRelations | 280 |

Automated Layout of Small Lattices Using Layer Diagrams | 291 |

Negation Opposition and Possibility in Logical Concept Analysis | 130 |

A PCSCompletion of Semilattices | 146 |

Towards a Generalisation of Formal Concept Analysis for Data Mining Purposes | 161 |

Interactive Association Rules Discovery | 177 |

Counting Pseudointents and Pcompleteness | 306 |

309 | |

### Other editions - View all

### Common terms and phrases

algorithm applied association rules B-Tree base table binary relations Boolean algebra classiﬁcation clone items closed sets closure system column complete lattice Computer Science concept hierarchy concept lattice conceptual graph Conceptual Knowledge Processing conceptual scales consider consistent contains corresponding deﬁned Deﬁnition denote diﬀerent disjunction distributive lattice domain dual bonds eﬀect equivalent example extent ﬁnd ﬁnite ﬁrst Formal Concept Analysis formulas functional dependencies fuzzy attribute implications fuzzy set Galois connections Ganter given Gmin graph homographs ICFCA idempotent identiﬁed instantiation irreducible knowledge structure left-relation Lemma line diagram LNAI logic many-valued context maps mathematical matrix meet-irreducible elements method Missaoui modal negation objects operations paper polynomial preconcept lattice problem proof Proposition pseudo-closed set pseudo-intents pseudocomplemented quasi-closed query RD-Tree relational algebra relational databases represent representation rows semantics semilattice semimodules semiring speciﬁc Springer subset Theorem theory Universit¨at values vectors