artifact
active
artifact:finger-exercises-in-formal-concept-analysis-2006-iccl-summer-school

Finger Exercises in Formal Concept Analysis (2006 ICCL Summer School)

Slide deck tutorial on Formal Concept Analysis by Bernhard Ganter presented at Dresden ICCL Summer School, June/July 2006.

Neighborhood — ranked by edge-count

Methods (2)

method
  • Attribute Exploration
    about
    Interactive algorithm for discovering complete implicational knowledge by computing stem base and seeking counterexamples.
  • rule exploration
    about
    Generalization of attribute exploration to FOL rules via factoring modulo context automorphisms.

Concepts (8)

concept
  • Concept Lattice
    about
    Central algebraic structure in FCA that orders formal concepts and preserves information from formal contexts.
  • Closure Operators
    about
    Operators X → X'' on subsets of objects or attributes, satisfying extensivity, monotonicity and idempotence.
  • implication
    about
    Implication A → B holds in a formal context iff every object that has all attributes in A also has all in B.
  • Next Closure Algorithm
    about
    Efficient algorithm for computing all closed sets (intents or extents) in lectic order without storing exponential lists.
  • Stem Base
    about
    Canonical minimal generating set for the implicational theory of a formal context; sound, complete, and of minimal cardinality.
  • derivation operators
    about
    Mappings A' = {m | ∀g∈A: gIm} and B' = {g | ∀m∈B: gIm} that form the basis of concept formation.
  • Formal Context
    about
    Basic data type in FCA consisting of a triple (G, M, I) representing objects, attributes, and incidence relations.
  • Bernhard Ganter
    authored
    Author and primary expositor of Formal Concept Analysis methods in this pedagogical paper.