A fast incremental algorithm for constructing concept lattices
Necessary and sufficient conditions for an attribute set to be a new intent. The procedure of searching for canonical generators is improved. We prove that the number of children of any concept has an upper bound. The procedure of updating the upper neighbors of a new concept is improved. An efficient incremental algorithm for constructing concept lattices is proposed.
incremental algorithm concept lattice formal concept analysis lattice construction