Incremental Computation of Concept Diagrams
share
Suppose a formal context K=(G,M,I) is given, whose concept lattice B(K) with an attribute-additive concept diagram is already known, and an attribute column C=(G,n,J) shall be inserted to or removed from it. This paper introduces and proves an incremental update algorithm for both tasks.
READ FULL TEXT