区间概念格的纵向合并算法

为解决直接对不同形式背景的数据构建区间概念格后分别抽取关联规则会存在规则缺失的实际问题,必须首先对不同的区间概念格进行合并.为提高格结构的生成与合并效率,首先对区间概念格的渐进式生成算法进行改进,将概念分为存在概念、冗余概念和空概念,分别以结构体的形式存储;进一步,分析区间概念格中外延和内涵之间的二元关系,给出了区间概念格纵向合并的充分条件——区间概念格的一致性;讨论了内涵一致的概念在合并后分为六种情况,并给出相应的判定定理;应用广度优先原则,通过对原区间概念格节点内涵的类型判定及不同的处理方法,设计了一种区间概念格的纵向合并算法.最后,通过实例验证了算法的有效性和高效性.

Vertical union algorithm of interval concept lattices

To solve the practical problem that some rules may be lost when the association rules are extracted directly after the construction of interval concept lattice for the different formal context, the different interval concept lattices must be merged firstly. To improve the efficiency of lattice generating and consolidation, the incremental generation algorithm of interval concept lattice should be improved firstly, and then the concepts were stored in the form of structures which were divided into existence concepts, redundancy concepts and empty concepts. Secondly, the binary relation between extension and intension was analyzed and the sufficient condition of vertical merger, consistency of interval concept lattice, was defined. Thirdly the concepts which have consistent intension were divided into six kinds after merging and the corresponding decision theorem was given. In the end, based on the principle of breadth-first, a new vertical integration algorithm was designed through the type judgment and different processing methods of the concept lattice nodes in the original interval concept lattice. Finally, an application example verified the effectiveness and efficiency of the algorithm.