| 改进的Fp-Growth数据关联挖掘算法研究 |
| |
| 引用本文： | 邹永平.改进的Fp-Growth数据关联挖掘算法研究[J].河北能源职业技术学院学报,2013(1):64-66,70. |
| |
| 作者姓名： | 邹永平 |
| |
| 作者单位： | 江苏省无锡交通高等职业技术学校 |
| |
| 摘 要： | 改进后的Fp-Growth挖掘算法适用于对大型数据库的数据关联规则的挖掘,基于一种新的数据库分隔方法来分隔数据库,并对分隔得到的各数据库子集用算法进行约束频繁项集挖掘。改进的数据库划分策略克服了占用内存大的缺陷,提高了挖掘速度,实时性更强。
|
| 关 键 词： | Fp-Growth挖掘算法 数据关联 |
Improved Fp-Growth Data Association Mining Algorithm |
| |
| ZOU Yong-ping.Improved Fp-Growth Data Association Mining Algorithm[J].Journal of Hebei Energy Institute of Vocation and Technology,2013(1):64-66,70. |
| |
| Authors: | ZOU Yong-ping |
| |
| Institution: | ZOU Yong-ping(Jiangsu Wuxi Institute of Communications Technology,Wuxi Jiangsu,214151) |
| |
| Abstract: | This paper proposes an improved Fp-Growth algorithm,the improved Fp-Growth algorithm applied to a large database of data mining of association rules,based on a new database partition method to separate the database,and to get the database subset separated with algorithm for constrained frequent item-sets mining.The improved database partitioning strategy overcomes the defect of using too much memory,enhances the speed of mining,and strengthens the practicability. |
| |
| Keywords: | Fp-Growth mining algorithm data association |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
