一种基于概念矩阵的概念格生成算法  

New Algorithm of Generating Concept Lattice Based on Concept-matrix

作　　者：陈震[1] 张娜[1] 王甦菁[1] 

机构地区：[1]吉林大学计算机科学与技术学院,长春130012

出　　处：《计算机科学》2010年第9期180-183,共4页Computer Science

基　　金：国家高技术研究发展计划(863计划)(No.2007AA11z124);国家科技支撑计划子课题(No.2006BAJ18B02-06)资助

摘　　要：概念格作为形式概念分析理论中的核心数据结构,在机器学习和数据挖掘等领域有着广泛的应用。构造概念格十分重要,针对此引入了概念矩阵思想,提出了基于概念矩阵的概念格生成算法CMCG(Concept-Matrix Based Concepts Generation)。该算法从格的顶端节点开始构造,基于概念矩阵,利用属性的秩为每个节点生成它的所有子节点,完成子节点到父节点之间的链接,并生成哈斯图。给出了这种算法的理论依据。最后提供了这一算法的伪码,并通过实验证明了CMCG算法的时间性能优于Lattice算法。Concept lattice,the core data structure in FCA（Formal Concept Analysis）,has been widely used in machine learning and data mining.In its applications,building concept lattice is very important,for which an efficient algorithm CMCG based on concept-matrix was put forward.The algorithm started from the top node of the lattice,generated all subnodes for each node using the rank of the concept matrix＇s attributes,completed the link between the subnodes and their parent,and generated the Hasse graph.The validity of the algorithm was proved in theory.In the end,the pseudo code of CMCG algorithm was given and that performance of CMCG is superior in time to lattice algorithm was proved by experiments.

关 键 词：概念格 概念矩阵 矩阵的秩 形式概念分析 哈斯图 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]