| 关联规则DHP算法的研究与分析 |
| |
| 引用本文： | 潘燕燕.关联规则DHP算法的研究与分析[J].佛山科学技术学院学报(自然科学版),2012,30(2):30-32. |
| |
| 作者姓名： | 潘燕燕 |
| |
| 作者单位： | 福建船政交通职业学院信息系,福建福州,350007 |
| |
| 摘 要： | 举例说明了DHP算法的执行过程,并且对DHP的算法性能进行了分析。DHP算法高效地生成频繁项目集,解决了生成频繁2-项目集L2时的性能瓶颈问题,减少了事务数据库的内容和降低了数据库扫描的次数。
|
| 关 键 词： | 关联规则 DHP 事务数据库 |
A study and analysis of DHP algorithm for association rules |
| |
| PAN Yan-yan.A study and analysis of DHP algorithm for association rules[J].Journal of Foshan University(Natural Science Edition),2012,30(2):30-32. |
| |
| Authors: | PAN Yan-yan |
| |
| Institution: | PAN Yan-yan(Department of Information,Fujian Chuanzheng Communication College,Fuzhou 350007,China) |
| |
| Abstract: | Association rules can be used to find useful information from data.In light of the basic idea of DHP algorithm,we illustrate and analyze the execution and the performance of DHP algorithm in this paper.From the illustration and analysis we conclude that DHP algorithm generates frequent itemsets efficiently and breaks the bottleneck of the performance of the generated 2-itemsets,the L2.Consequently,the transaction database size and database scan decrease. |
| |
| Keywords: | association rule DHP transaction database |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
