Horizontal union algorithm of concept lattice based on Congener concept
基于同类概念的概念格横向合并算法

Congener concept was introduced into the lattice union algorithm, which was used to update each child node in less time according to the order relation of the concepts. It was further testified that to insert a small lattice into a large one would spend less time. 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.