A New Formal Concept Analysis Method and Its Construction Algorithm

For solving the redundancy of nodes and edges in concept lattice, we replace lattice with join-semilattice and present an algorithm which relies upon a strategy of gradual insertion of the concepts into the partially built hasse diagram. A threshold value is introduced to limit the number of concept nodes. We present the implementation of this algorithm and demonstrate the process of concept semilattice updating by an example. Experimental results show its effectiveness and efficiency.