分层概念格的上卷和下钻构造算法

Roll-Up and Drill-Down Building Algorithms of Layered Concept Lattice

当形式背景中的某些属性可以分解为若干子属性时,构建分层概念格模型,讨论原形式背景的概念格和分层形式背景的分层概念格之间的联系.提出由下层概念构造上层概念的上卷构造算法和由上层概念构造下层概念的下钻构造算法.实验表明,采用分层概念格模型可以建模复杂属性数据,分层概念格上卷构造算法和下钻构造算法可以提高构建概念格的效率.

A model of layered concept lattice is established,when the attributes of a formal context can be decomposed into some sub-attributes. The relationship between the original concept lattice and the layered concept lattice is discussed. Two algorithms are proposed： the roll-up algorithm and the drill-down algorithm. In the roll-up algorithm,the upper concept is constructed by the lower concept,and in the drill-down algorithm,the lower concept is constructed by the upper concept. Examples and numerical experiments show that the layered concept lattice model can be used to model complex attribute data.Furthermore,the roll-up algorithm and the drill-down algorithm improve the efficiency of building concept lattice.