基于不变属性集的概念格建格算法  

Constructing Algorithm of Concept Lattice Based on Constant Attribute Set

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

机构地区：[1]宜宾学院计算机科学系,四川宜宾644000 [2]宜宾学院数学系,四川宜宾644000

出　　处：《宜宾学院学报》2006年第6期4-8,共5页Journal of Yibin University

摘　　要：该论文证明了新对象增加不使属性集改变的条件下,新节点只可能在原概念格中某一节点的父节点中生成。并给出了新对象的属性集与原概念格中节点的属性集相交时生成新节点的充要条件。据此提出了新增对象时生成新节点的建格算法;最后将算法与著名的Godin的算法比较,说明了在此条件下,本算法对节点的搜索范围会缩小,从而可以加快新增对象时的概念格的重建速度。确定了新节点在原概念格中的直接子节点和直接父节点的计算方法,解决了生成新节点后的连线接问题。On condition that the attribute set is constant when the new element is increased, the necessary and sufficient condition of generating new elements is obtained. Based on the condition, the algorithm of increment building concept lattice is given here. At last, compared with the Godin＇s algorithm, it is proved that this algorithm can be cut down searching elements. The way of computing immediate predecessor （successor） of the new element is given, so the problem of constructing concept lattice is solved on condition that the attribute set is constant.

关 键 词：概念格 属性集 算法 建格 

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