摘要
作为数据挖掘核心任务之一的关联规则发现已经得到了广泛的研究。而由二元关系导出的概念格则是一种非常有用的形式化工具,非常适于发现数据中潜在的概念。分析了概念格与关联规则提取之间的关系,根据需要对格结构进行了相应的修改,提出了关联规则格的概念,并提出属性链表这种数据结构,基于这种链袁提出了关联规则格的渐进式构造算法。通过对算法进行分析,得出了比Godin算法更好的时间效率。
Association rule discovery, as a kernel task of data mining, has been studied widely. Concept lattice, induced from a binary relation between objects and features , is a very useful formal tool and is fit for discovering the potential concept below the data. The relationship between concept lattice and association rule discovery is analyzed. The structure of node in lattice is modified according to the requirement and the conception of association rule lattice and the data structure of attribute linked-list are put forward. Based on this kind of linked-list, the incremental algorithm for building association rule lattice is put forward. The algorithm is analyzed with a better efficiency than godin algorithm.
出处
《计算机工程与设计》
CSCD
北大核心
2005年第2期320-322,331,共4页
Computer Engineering and Design
基金
河北省自然科学基金项目(600225)。
