计算机与现代化 ›› 2010, Vol. 1 ›› Issue (11): 16-18,2.doi: 10.3969/j.issn.1006-2475.2010.11.005
• 算法设计与分析 • 上一篇 下一篇
刘娜,何丰
收稿日期:
修回日期:
出版日期:
发布日期:
LIU Na, HE Feng
Received:
Revised:
Online:
Published:
摘要：
由二元关系导出的概念格是一种非常有用的形式化工具，也很适合于发现数据中潜在的概念。概念格的算法一直是数据挖掘领域研究的热点。本文根据需要对概念格的结构进行一定的修改，采用一个带头、尾指针的链表作为整个算法的数据结构，提出概念格的渐进式维护算法，该算法中包含两个算法，即渐进式构造算法和渐进式删除算法。最后，通过将该算法和其他算法进行比较，得出较好的时间和空间效率。
关键词: 概念格, 数据挖掘, 链表, 渐进式, 维护
Abstract:
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 linkedlist 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.
Key words: concept lattice, data mining, linked list, incremental, maintaining
中图分类号:
TP301.6
刘娜;何丰. 概念格的渐进式维护算法[J]. 计算机与现代化, 2010, 1(11): 16-18,2.
LIU Na;HE Feng. Incremental Algorithm of Maintaining Concept Lattice[J]. Computer and Modernization, 2010, 1(11): 16-18,2.
0 / / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://www.c-a-m.org.cn/CN/10.3969/j.issn.1006-2475.2010.11.005
http://www.c-a-m.org.cn/CN/Y2010/V1/I11/16
