摘要： 提出了一种基于改进的B+树结构及一种新的数据挖掘算法,HB-Mine,该算法通过构造哈希函数,获得B+树的关键字,并在B+树的叶子结点上构建链表结构,记录相关关键字的项集及频数,这样在无需产生巨大的候选项集的情况下,挖掘出频繁模式,且具有较高的时间效率。

关键词: 数据挖掘, 关联规则, 频繁模式, B+树

Abstract: This paper puts forwards an improved B+-tree structure and a new mining algorithms , HCS-Mine, it makes hash function to gain the key of the B+-tree, and structures the chain structure at the node of the leafage of B+-tree, in which records the item set and the frequence. It mines frequent patterns without candidate generation and has better time efficiency .

中图分类号: 

• TP311.133