基于项对索引链表的优化FP-Growth算法

An Optimized FP- Growth Algorithm Based on Indexed Pair of Items List

提出了基于邻接矩阵思想的FP-Growth改进算法IPILFPG,它采用项对索引链表作为FP树的辅助存储,避免重复遍历路径,优化搜索过程.该算法显著降低挖掘存储空间以及时间复杂度,提高挖掘效率.通过实验验证其正确性,并与其它算法比较验证其高效性.

In this paper, an improved algorithm IPILFPG is proposed, which is based on adjacency matrix and FP - Growth,it adopts the indexed pair of items list as auxiliary storage of FP tree, which avoids repeatedly traversing path and optimizes searching process. This algorithm significantly reduces storage space and time complexity, meanwhile improving the mining efficiency. In this article, its correctness and efficiency comparison with other algorithms through experiments are verified.