Approximation concept lattice and incremental constructing algorithm
近似概念格及其增量构造算法研究*

The classic concept lattice is limited in incomplete information. In order to solve this limitation,presented a new concept lattice model-approximation concept lattice, witch could be used to deal with missing-value in formal context. On that basis, it designed an improved incremental constructing algorithm based on hash technique and incremental computation of nearest father nodes. Extensive experiments on the random data set demonstrate the improvements of the construction efficiency, especially for the data sets with large scale and density.