首页 | 本学科首页   官方微博 | 高级检索  
     

基于属性链表的概念格纵横向维护算法
引用本文:张春英,郭景峰,刘保相.基于属性链表的概念格纵横向维护算法[J].计算机工程与应用,2004,40(5):185-187.
作者姓名:张春英  郭景峰  刘保相
作者单位:1. 河北理工学院数理系,河北,唐山,063009
2. 燕山大学信息学院,河北,秦皇岛,066004
摘    要:概念格的维护是对已建好的概念格进行对象的插入、删除和修改、属性的删减操作时使概念格保持其特性的一种操作。该文提出了一种基于属性链表的概念格的纵横向维护算法,并对算法进行了分析,得出了较高的时间效率。

关 键 词:概念格  属性链表  纵横向维护
文章编号:1002-8331-(2004)05-0185-03

Logitudianal and Transverse Maintenance Algorithm of Concept Lattice Based on Attribute Linked-List
Zhang Chunying,Guo Jingfeng,Liu Baoxiang.Logitudianal and Transverse Maintenance Algorithm of Concept Lattice Based on Attribute Linked-List[J].Computer Engineering and Applications,2004,40(5):185-187.
Authors:Zhang Chunying  Guo Jingfeng  Liu Baoxiang
Affiliation:Zhang Chunying 1 Guo Jingfeng 2 Liu Baoxiang 11
Abstract: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.
Keywords:Concept Lattice  Attribute Linked-list  Logitudianal and Transve rse Maintenance
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号