摘要
利用了有向项集图来存储事务数据库中有关频繁项集的信息,提出了有向项集图的三叉链表式存储结构和基于有向项集图的频繁闭项集挖掘算法。不仅实现了事务数据库的一次扫描,减少了I/O代价,而且提高了数据结构的存储空间效率和频繁闭项集挖掘算法的执行时间效率。
This paper presents the directed itemsets graph to store the information of frequent itemsets of transaction databases, and puts forward the trifurcate linked list storage structure of directed itemsets graph, and provides the mining algorithm of frequent closed itemsets based on directed itemsets graph. Not only realize scanning databases only one time and decrease I/O resources consumption, but also improve storage efficiency of data structure and time efficiency of mining algorithm.
出处
《微电子学与计算机》
CSCD
北大核心
2007年第8期28-30,34,共4页
Microelectronics & Computer
基金
国家自然科学基金项目(70471056)
关键词
数据挖掘
关联规则
频繁闭项集
有向项集图
三叉链表式存储结构
挖掘算法
data mining
association rules
frequent closed itemsets
directed itemsets graph
trifurcate linked list storage structure
mining algorithm
