A fast incremental algorithm for constructing concept lattices

作者：

Highlights：

• 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.

摘要

•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.

论文关键词：Formal Concept Analysis,Concept lattice,Incremental algorithm,Lattice construction

论文评审过程：Available online 31 January 2015.

论文官网地址：https://doi.org/10.1016/j.eswa.2015.01.044