属性添加情况下的概念格重构算法  

Reconstructing algorithm of concept lattice in adding attribute process

作　　者：谢润[1] 裴峥[2] 何昌莲[3] 

机构地区：[1]宜宾学院数学系,四川宜宾644007 [2]西华大学数学与计算机学院 [3]宜宾学院计算机科学系,四川宜宾644007

出　　处：《系统工程学报》2007年第4期426-431,448,共7页Journal of Systems Engineering

基　　金：四川省杰出青年基金资助项目(06ZQ026-037);四川省教育厅重点资助项目(2005A121);宜宾学院青年基金资助项目

摘　　要：研究在给定的形式背景下,通过逐步添加属性建造概念格的方法.一般地,初始概念格可由部分属性生成.当添加属性时,得到了新节点与它在原概念格中的直接父节点是一一对应的结论.证明了所有新节点在原概念格中的直接父节点,只可能在某个节点和它的子节点中.基于上述性质,给出了添加属性情况下的重建概念格算法.此算法的优点是生成新节点的范围小,构建概念格的速度快.In a fixed formal context, the method to construct concept lattice by adding attributes step by step is investigated. Generally, initial concept lattice can be constructed by partial attributes. When a new attribute is added in the concept lattice, the conclusion that there exists one-to-one mapping between new nodes in new concept lattice and corresponding immediate predecessor in old concept lattice is obtained. It is proved that immediate predecessor of all new nodes is only one of a node or successors in old concept lattice. Based on these properties, a reconstructing algorithm of concept lattice by adding attributes is proposed. Advantage of tire algorithm is that scope of generating new nodes is small, and concept lattice is quickly constructed.

关 键 词：形式概念分析 概念格 算法 数据挖掘 

分 类 号：O153.1[理学—数学]