基于FP-矩阵的频繁项集挖掘算法 |
| |
引用本文: | 刘芝怡,尹飞鸿. 基于FP-矩阵的频繁项集挖掘算法[J]. 机械设计与制造工程, 2011, 0(8): 40-43,46 |
| |
作者姓名: | 刘芝怡 尹飞鸿 |
| |
作者单位: | 常州工学院计算机信息工程学院,江苏常州213002 |
| |
摘 要: | 针对频繁项集挖掘时间与空间效率低的问题,提出一种基于FP一矩阵的高效频繁项集挖掘算法。用此算法构造FP-矩阵压缩事务数据库,无需递归构造条件模式树,仅需3次扫描数据库即可生成所有频繁项集。最后的实验证明了该算法的有效性。
|
关 键 词: | 数据挖掘 频繁项集 FP-矩阵 |
Frequent Item Set Mining Algorithm Based on FP- Matrix |
| |
Affiliation: | LIU Zhi - yi, YIN Fei - hong (Changzhou Institute of technology, Jiangsu Changzhou, 213002, China) |
| |
Abstract: | Aiming at the low efficiency in time and space for frequent item set mining, it proposes an algorithmFPM - Growth for frequent item set mining based on FP - matrix. The algorithm constructs FP - Matrix to compress business database. Without recursion condition pattern tree, the algorithm needs to scan database only three times to produce all frequent item set. Lastly the experiment proves that the algorithm is effective. |
| |
Keywords: | Data Mining Frequent Item Set FP- Matrix |
本文献已被 维普 等数据库收录! |
|