概念格的渐进式维护算法  

Incremental Algorithm of Maintaining Concept Lattice

作　　者：刘娜[1] 何丰[1] 

机构地区：[1]北方民族大学计算机科学与工程学院,宁夏银川750021

出　　处：《计算机与现代化》2010年第11期16-18,23,共4页Computer and Modernization

摘　　要：由二元关系导出的概念格是一种非常有用的形式化工具,也很适合于发现数据中潜在的概念。概念格的算法一直是数据挖掘领域研究的热点。本文根据需要对概念格的结构进行一定的修改,采用一个带头、尾指针的链表作为整个算法的数据结构,提出概念格的渐进式维护算法,该算法中包含两个算法,即渐进式构造算法和渐进式删除算法。最后,通过将该算法和其他算法进行比较,得出较好的时间和空间效率。Concept lattice,induced from a binary relation between objects and features,is a very useful formal tool and fit for discovering the potential concept below the data.The algorithm of the lattice is still the hot spot.The structure of node in lattice,which is called association rule lattice and modified according to the requirements and the data structure of linked-list with a head finger and a trail finger is adopted.Based on this,the incremental algorithm for maintaining concept lattice is put forward.The algorithm is analyzed with better time and space efficiency than other algorithms.

关 键 词：概念格 数据挖掘 链表 渐进式 维护 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]