计算机工程与应用 ›› 2010, Vol. 46 ›› Issue (35): 33-35.DOI: 10.3778/j.issn.1002-8331.2010.35.009

• 研究、探讨 • 上一篇    下一篇

Bordat概念格构造算法的改进

陈庆燕   

  1. 滨州学院 计算机科学技术系,山东 滨州 256600
  • 收稿日期:2010-05-10 修回日期:2010-08-27 出版日期:2010-12-11 发布日期:2010-12-11
  • 通讯作者: 陈庆燕

Improvement on Bordat algorithm for constructing concept lattice

CHEN Qing-yan   

  1. Department of Computer Science and Technology,Binzhou University,Binzhou,Shandong 256600,China
  • Received:2010-05-10 Revised:2010-08-27 Online:2010-12-11 Published:2010-12-11
  • Contact: CHEN Qing-yan

摘要: 作为一种重要的概念格构造算法,Bordat算法简洁、直观且易于并行化,但该算法本身的效率并不高。在深入研究格结构特性的基础上,给出了它的改进算法。首先对形式背景的属性集进行等价类划分,以减少参与计算的属性个数,并消除了在产生子节点集的过程中,对属性之间的多余比较,从而大大提高算法的效率,并通过实例和实验说明该算法的正确性和有效性。

Abstract: As an important algorithm for constructing concept lattice,Bordat algorithm is simple,intuitive and easy to parallelize,but the efficiency of that is not high.Based on the research of lattice structure characteristics,the improvement on Bordat algorithm is given in this paper.Making the attributes of formal context for equivalence class partition orders to reduce the number of attributes in calculation,and avoiding the unnecessary comparison between the attributes in the process of generating child-nodes set.So the better computation efficiency is achieved,and the detailed example and experimental results demonstrate its correctness and effectiveness.

中图分类号: