The test results show that this algorithm makes better improvement in time complexity than the horizontal union algorithms of common universe concept lattice found in related literature.
Using the inherent general-special relation between concepts in sublattice, the horizontal unionalgorithm of multiple concept lattices to construct the concept lattice is also presented.
最后结合子概念格中概念间固有的泛化-特化关系，提出一种多概念格的横向合并算法来构造概念格。
3
This algorithm can be used to calculate not only intersection but also set-theoretic differences and union of two polygons .