An improved addintent algorithm for building concept lattice
The algorithm research on building concept lattice is one of the most important topics in formal concept analysis. So far, two types of algorithms called the batch algorithm and the incremental algorithm have been proposed. As the fastest incremental algorithm, AddIntent algorithm is a very promising algorithm. But in the process of recursive construction of concept lattice in AddIntent algorithm, some concepts have been accessed repeatedly so that unnecessary time consuming is caused. Making full use of the structure of concept lattice, the improved AddIntent algorithm proposed in this paper can avoid repeated comparison of concepts by adding marks to the concepts which are accessed, new or updated. Experimental results show that this algorithm can improve the efficiency significantly compared with the original AddIntent algorithm.