Formal Concept Analysis

Representing partition lattices through FCA.- Fixed-Point Semantics for Barebone Relational Concept Analysis.- Boolean Substructures in Formal Concept Analysis.- Enumerating Maximal Consistent Closed Sets in Closure Systems.- A new Kind of Implication to Reason with Unknown Information.- Pruning Techniques in LinCbO for Computation of the Duquenne-Guigues Basis.- Approximate Computation of Exact Association Rules.- An Incremental Recomputation of From-Below Boolean Matrix Factorization.- Clustering and Identification of Core Implications for Grouping Objects.- Extracting Relations in Texts with Concepts of Neighbours.- Triadic Exploration and Exploration with Multiple Experts.- Towards Interactive Transition from AOC Poset to Concept Lattice.- Visualization of Statistical Information in Concept Lattice Diagrams.- Force-Directed Layout of Order Diagrams Using Dimensional Reduction.- Sandwich: an Algorithm for Discovering Relevant Link Keys in an LKPS Concept Lattice.- Decision Concept Lattice vs Decision Trees and Random Forests.- Exploring Scale-Measures of Data Sets.- Filters, Ideals and Congruence on Double Boolean Algebras.- Diagrammatic Representations of Conceptual Structures.