Next Closure Algorithm

Efficient algorithm for computing all closed sets (intents or extents) in lectic order without storing exponential lists.

Neighborhood — ranked by edge-count

community

method

Next intent algorithm
extends
Application of Next Closure to enumerate all concept intents of a formal context.
Next extent algorithm
extends
Application of Next Closure to enumerate all concept extents of a formal context.

concept

Lectic Order
associated_with
Linear order on subsets of M used by Next Closure algorithm; equivalent to lexicographic order on incidence vectors.

artifact

Finger Exercises in Formal Concept Analysis (2006 ICCL Summer School)
about
Slide deck tutorial on Formal Concept Analysis by Bernhard Ganter presented at Dresden ICCL Summer School, June/July 2006.

cosine ≥ 0.65 · no typed edge

Entities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.

Closure Operatorsconcept0.801
Operators X → X'' on subsets of objects or attributes, satisfying extensivity, monotonicity and idempotence.
Closingmethod0.783
Dynamic condition: ending a branch or closing a frame.
Functional closureconcept0.774
The property of a subsystem that cannot influence others; used to lesion systems in simulations.
Patch-Closureconcept0.752
A set property meaning all coordinate patches of its elements remain within the set; proved equivalent to axis-aligned hyperrectangles
Closure to Efficient Causationframework0.740
Rosen's key concept making the (M,R)-system an irreducible cause of its own organization.
Organizational Closureconcept0.736
Circular topology of production processes whereby the product of a system's operation is its own organization.
Closure Thesisconcept0.735
Every autonomous system is organizationally closed, with eigenbehaviour constituting invariant identity.
Pseudo-intents can be computed with a modified next-intent algorithm.claim0.731
Claim about computational feasibility of pseudo-intents.