扩展概念格的维护  

Maintenance of Extended Concept Lattice

作　　者：吴刚[1] 简宋全[1] 胡学钢[1] 蒋美华[1] 

机构地区：[1]合肥工业大学计算机与信息学院,合肥230009

出　　处：《计算机工程与应用》2002年第4期76-78,共3页Computer Engineering and Applications

摘　　要：扩展概念格是作者在Galois格中引入等价内涵关系而得到的一种扩展形式,并且已对其渐进式构造进行了研究。文章针对已构造好的扩展概念格,在数据对象删除时如何维护的问题,提出了一种算法,经验证是有效的。Authors have presented Extended Concept Lattice by introducing equivalence relation between intensions to Galois Concept Lattice and studied its incremental algorithm.This paper proposes an maintaining algorithm for built Ex-tended Concept Lattice and its corresponding graph when some object is deleted from context.Results of empirical test shows that it is efficient.

关 键 词：KDD 概念格 扩展概念格 维护 知识发现 

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