摘要
给出了一种基于链表结构的Godin算法实现方法,该方法采用链表结构组织格结点,并利用索引表,实现了对概念格子结点的快速查找,提高了概念格渐进式构造的效率。最后,以天体光谱数据作为形式背景,实验结果表明,该方法的构造效率要明显优于基于顺序结构的Godin算法。
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.
出处
《计算机工程与应用》
CSCD
北大核心
2007年第11期178-180,共3页
Computer Engineering and Applications
基金
国家自然科学基金(the National Natural Science Foundation of China under Grant No.60573075)。
关键词
概念格
Godin算法
链表结构
索引表
concept lattice
Godin algorithm
linked list structure
indexed table
