A Bottom-Up Incremental Algorithm of Building Concept Lattice

The construction algorithm of concept lattice is an important topic in formal concept analysis. So far, a series of algorithms have been proposed, which can be divided into two categories: Batch and incremental algorithms. Because it is easy to maintain, the incremental algorithms are very promising algorithms. Based on analysis to the process of incremental construction of concept lattice, a bottom-up incremental algorithm of building concept lattice has been proposed. The tests show that this algorithm outperforms classical Godin algorithm for most types of contexts.