Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (33): 35-37.DOI: 10.3778/j.issn.1002-8331.2009.33.012

• 研究、探讨 • Previous Articles     Next Articles

Algorithm of generating concept lattice based on binary tree

MAO Hua1,2,3,ZHANG Zhi-xing1,2,3   

  1. 1.College of Mathematics and Computer Science of Hebei University,Baoding,Hebei 071002,China
    2.Mathematical Research Center of Hebei Province,Shijiazhuang 050016,China
    3.Key Lab. in Machine Learing and Intelligence Computational of Hebei Province,Baoding,Hebei 071002,China
  • Received:2009-07-08 Revised:2009-09-25 Online:2009-11-21 Published:2009-11-21
  • Contact: MAO Hua


毛 华1,2,3,张智星1,2,3   

  1. 1.河北大学 数学与计算机学院,河北 保定 071002
    2.河北省数学研究中心,石家庄 050016
    3.河北省机器学习与计算智能重点实验室,河北 保定 071002
  • 通讯作者: 毛 华

Abstract: Concept lattice is a powerful tool of data analysis.The binary tree in the data structure has the simple storage structure.By giving a type of concept lattice which has a special structure,on account of this type of concept lattice,this binary tree structure is used to re-organize the concepts in concept lattice.The algorithm which is based on add-object incremental algorithm to generate the concept lattice is researched.By using this structure of binary tree,in some cases,it can reduce the judging scope of old concept and update concept.At the same time,the effectiveness of this algorithm is illustrated combined with examples.

Key words: concept lattice, binary tree, incremental algorithm, object

摘要: 概念格是数据分析的一种有力工具。而二叉树在数据结构中具有简单的存储结构。给出了一类具有特殊结构的概念格,针对这种类型的概念格,采用二叉树的结构对概念格的节点进行重新的组织,研究了基于添加对象的渐进式生成概念格的算法。利用这种二叉树的结构,在某些情况下可以减少判断不变概念或更新概念的范围,同时,结合实例说明了这种算法的有效性。

关键词: 概念格, 二叉树, 渐进式算法, 对象

CLC Number: