基于对象扩展的概念格批处理构造算法  

Batch Construction Algorithm of Concept Lattice Based on Object Expansion

作　　者：王欣欣[1] 张素兰[1] 

机构地区：[1]太原科技大学计算机科学与技术学院,太原030024

出　　处：《太原科技大学学报》2009年第5期368-373,共6页Journal of Taiyuan University of Science and Technology

基　　金：山西省自然科学基金项目(2006011041)

摘　　要：大多数概念格批处理构造算法,由于产生大量不满足外延最大扩展性的结点即冗余结点,导致相同内涵的结点重复生成,降低了概念格的构造效率。给出了一种新的基于对象扩展的概念格批处理构造算法(OEBCA),该算法对每层新生成的结点进行对象扩展,使其满足外延最大扩展性,相同内涵的结点只生成一次,从而避免了冗余结点的产生,提高了概念格的构造效率。实验结果表明,该算法是正确的和有效的。In most batch construction algorithms of dundant nodes dissatisfying with the most expansib the concept lattice, With the mass nodes being built, namely, re- ility of extent, some nodes of the same intension are repeatedly created. As a result, the construction efficiency of the concept lattice is greatly reduced. The paper presents a new batch construction algorithm of the concept lattice（OEBCA） based on object expansion,which expands the objects to satisfy the most expansibility of extent for the newly built nodes of each layer. Those nodes of the same intension are only generated once. Thus, redundant nodes are avoided to improve the construction efficiency of the concept lattice. Experiment results show the algorithm is correct and efficient.

关 键 词：概念格 冗余结点 对象扩展 批处理构造算法 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]