A fast algorithm for building concept lattice
Sheng-Yong Qiao, Shuo-Pin Wen, Caiyun Chen, Zhiguo Li · 2004
The concept (or Galois) lattice produced from a binary relation which has been proved is useful for many applications. But building concept lattice is difficult. Reference [L. Nourine, et al., 1999] gives a fast algorithm for building lattice, but the concept lattice has some special characters. This article presents a fast algorithm for building concept lattice and corresponding graph, an also gives the time complexity of this algorithm. Database updating is always necessary. In our paper, we also give an algorithm for modify lattice when data update happened.