Next extent algorithm

Application of Next Closure to enumerate all concept extents of a formal context.

Neighborhood — ranked by edge-count

concept

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

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.

Next intent algorithmmethod0.828
Application of Next Closure to enumerate all concept intents of a formal context.
extentconcept0.753
The set of objects A of a formal concept (A,B).
OPTICS Algorithmmethod0.749
Density-based clustering used within spectral coarse-graining approach.
Evolutionary Algorithmsmethod0.748
Machine learning approach using evolutionary processes to generate and select designs, used to blur the designed vs. evolved distinction
Forward Algorithmmethod0.742
Used to update pain beliefs online from observations of happiness
Pseudo-intents can be computed with a modified next-intent algorithm.claim0.738
Claim about computational feasibility of pseudo-intents.
Belief Propagation Algorithmmethod0.734
Message passing algorithm based on Bethe approximation.
Identification of algorithms implemented in attention layers, distributed across attention headsfinding0.731
VPD successfully recovered interpretable attention algorithms (previous-token behavior, syntax-boundary routing) in weight space without requiring manual decomposition across heads.