| 基于哈希和合并技术的FP-Growth新算法 |
| |
| 引用本文： | 何晴,陆黎明. 基于哈希和合并技术的FP-Growth新算法[J]. 上海师范大学学报(自然科学版), 2018, 47(4): 469-473 |
| |
| 作者姓名： | 何晴 陆黎明 |
| |
| 作者单位： | 上海师范大学信息与机电工程学院 |
| |
| 摘 要： | 对频繁模式增长(FP-Growth)算法进行了改进,用哈希头表代替头表.通过合并频繁模式树(FP-Tree)中支持数相同的结点,压缩了树的规模,有效地节省了空间.实验结果表明,改进后的算法在查找效率上有了大幅度的提高,可以更好地适用于大规模数据集的关联规则挖掘.
|
| 关 键 词： | 频繁模式增长(FP-Growth) 关联规则 频繁项集 哈希头表 合并结点 |
| 收稿时间： | 2016-09-24 |
A new FP-growth based on Hash and merging techniques |
| |
| He Qing and Lu Liming. A new FP-growth based on Hash and merging techniques[J]. Journal of Shanghai Normal University(Natural Sciences), 2018, 47(4): 469-473 |
| |
| Authors: | He Qing and Lu Liming |
| |
| Affiliation: | The College of Information, Mechanical and Electrical Engineering, Shanghai Normal University, Shanghai 200234, China and The College of Information, Mechanical and Electrical Engineering, Shanghai Normal University, Shanghai 200234, China |
| |
| Abstract: | In this paper,we improve frequent pattern growth(FP-Growth) algorithm,we replace the header table with Hash-header table.By merging the same frequency nodes in frequent pattern tree(FP-Tree),we compress the scale of the tree.The experimental results show that the proposed algorithm has improved the efficiency of query,and it can be applied in mining large data sets with association rules. |
| |
| Keywords: | frequent pattern growth (FP-Growth) association rules frequent item sets Hash-header table merging nodes |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《上海师范大学学报(自然科学版)》浏览原始摘要信息 |
|
点击此处可从《上海师范大学学报(自然科学版)》下载免费的PDF全文 |
|
