摘要
概念格的维护是对已建好的概念格进行对象的插入、删除和修改、属性的删减操作时使概念格保持其特性的一种操作。该文提出了一种基于属性链表的概念格的纵横向维护算法,并对算法进行了分析,得出了较高的时间效率。
The maintenance of concept lattice is a kind of operation which k eeps the characteristic of concept lattice when an object is inserted into latt ice or deleted or modified or an attribute is deleted.This paper presents a log itudianal and Transverse maintenance algorithm of concept lattice based on attr ibute linked-list,and analyze this algorithm,getting a better time efficienc y.
出处
《计算机工程与应用》
CSCD
北大核心
2004年第5期185-187,共3页
Computer Engineering and Applications
关键词
概念格
属性链表
纵横向维护
Concept Lattice,Attribute Linked-list,Logitudianal and Transve rse Maintenance
