中文摘要：

针对传统的概念格合并算法仅为单向的纵向或横向合并,提出一种基于概念内涵、外延升降序的双序渐进式合并算法。按照概念的内涵或外延的升序和降序,从两个方向（由上到下和由下到上）同时进行子概念格的纵向或横向合并。算法分析和示例结果表明,该算法不仅在结构上较好地保留了原有信息,而且在效率上也获得了显著的提高。

英文摘要：

In existing literatures,the algorithms of concept lattice union are all one-way vertical or horizontal union.Based on concept lattice duality principle,this paper proposed a two-way union algorithm.Comparing with vertical or horizontal algorithms,this algorithm does union by the ascending and descending order of the intension and extension of concept.Algorithm analysis and example show that the new algorithm retains the structural information and its efficiency is significantly improved.