计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (11): 178-180.

• 数据库与信息处理 • 上一篇    下一篇

基于链表结构的概念格渐进式构造

蒋义勇 张继福 张素兰   

  1. 太原科技大学计算机科学与技术学院 太原科技大学计算机科学与技术学院 北京科技大学信息工程学院
  • 收稿日期:2006-08-16 修回日期:1900-01-01 出版日期:2007-04-11 发布日期:2007-04-11
  • 通讯作者: 张继福

Incremental Construction of concept Lattice based on Linked list Structure

YiYong Jiang JiFu Zhang SuLang Zhang   

  • Received:2006-08-16 Revised:1900-01-01 Online:2007-04-11 Published:2007-04-11
  • Contact: JiFu Zhang

摘要: Godin算法是最典型的,也是最常用的概念格渐进式构造算法之一。本文给出了一种基于链表结构的Godin算法实现方法,该方法采用链表结构组织格结点,并利用索引表,实现了对概念格子结点的快速查找,提高了概念格渐进式构造的效率。最后,以天体光谱数据作为形式背景,实验结果表明,该方法的构造效率要明显优于基于顺序结构的Godin算法。

Abstract: Godin algorithm is one of the most typical algorithms and frequently used in the incremental construction of concept lattice. One realization method of Godin algorithm based on linked list structure is presented. Concept lattice node is organized as linked list structure, which helps to quickly search the child node by using indexed table. Accordingly,the time-efficiency of concept lattice incremental construction is improved. Finally, by taking the star spectra data as the formal context, experiment results show that the method is evidently prior to the construction efficiency of the Godin algorithm based on the sequential structure.