| 基于项对索引链表的优化FP-Growth算法 |
| |
| 引用本文： | 温海波.基于项对索引链表的优化FP-Growth算法[J].哈尔滨师范大学自然科学学报,2013(4):55-59. |
| |
| 作者姓名： | 温海波 |
| |
| 作者单位： | 合肥工业大学;安徽交通职业技术学院 |
| |
| 基金项目： | 安徽省教学研究项目（2010610） |
| |
| 摘 要： | 提出了基于邻接矩阵思想的FP-Growth改进算法IPILFPG,它采用项对索引链表作为FP树的辅助存储,避免重复遍历路径,优化搜索过程.该算法显著降低挖掘存储空间以及时间复杂度,提高挖掘效率.通过实验验证其正确性,并与其它算法比较验证其高效性.
|
| 关 键 词： | 数据挖掘 关联规则 FP-Growth 邻接矩阵 约束路径 项对索引链表 |
An Optimized FP-Growth Algorithm Based on Indexed Pair of Items List |
| |
| Wen Haibo.An Optimized FP-Growth Algorithm Based on Indexed Pair of Items List[J].Natural Science Journal of Harbin Normal University,2013(4):55-59. |
| |
| Authors: | Wen Haibo |
| |
| Affiliation: | Wen Haibo ( Hefei University of Technology, Anhui Communications Technology Institute) |
| |
| Abstract: | 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. |
| |
| Keywords: | Data mining Association rules FP - Growth Adjacency matrix Constraint path Indexed pair of items list |
| 本文献已被 维普 等数据库收录！ |
