一种高效的改进频繁项集挖掘算法

An Efficient and Improved Algorithm for Mining Frequent Itemsets

提出一种结合投影与排序频繁项集位置索引表的挖掘频繁项集改进算法,通过单趟扫描数据库,建立存储项集关系的"投影"数据结构,直接找到频繁1-项集及通过内积运算获得频繁2-项集.然后建立高阶项集的位置索引表,通过跨越式搜索和连接,依次找出后续频繁项集.通过实验分析,大大提高了寻找频繁项集的效率.

This paper proposes an improved algorithm for mining frequent itemsets based on the projection andsorting location index table of frequent itemsets. The data structure of ＂projection＂ is set up by scan database once,and find the frequent 1- itemsets directly and obtain frequent 2- itemsets by inner product operation. Then, thelocation index table of the higher order itemsets is established, find the frequent itemsets by leaping searching andlinking. Through the experimental analysis, the efficiency of finding frequent itemsets is greatly improved.