| Apriori算法的改进算法设计与分析 |
| |
| 引用本文： | 陈自力.Apriori算法的改进算法设计与分析[J].闽江学院学报,2011,32(2):38-40. |
| |
| 作者姓名： | 陈自力 |
| |
| 作者单位： | 福建交通职业技术学院信息系,福建福州,350007 |
| |
| 摘 要： | 提出采用事务压缩和哈希技术相结合方式的改进算法.该算法通过备份数据库Dk生成候选项目集Ck,在生成Ck的同时计算支持度.针对生成频繁2-项目集L2的瓶颈,在生成L2的时候使用DHP算法.从时间复杂度上对Apriori算法和改进算法进行比较,说明改进算法在效率上优于Apriori算法.
|
| 关 键 词： | 关联规则 Apriori DHP算法 |
Design and analysis of the improved algorithm based on Apriori |
| |
| CHEN Zi-li.Design and analysis of the improved algorithm based on Apriori[J].Journal of Minjiang University,2011,32(2):38-40. |
| |
| Authors: | CHEN Zi-li |
| |
| Institution: | CHEN Zi-li (Department of Information Technology and Engineering,Fujian Communication Technology College,Fuzhou,Fujian 350007,China) |
| |
| Abstract: | This paper carries out analysis on now available improvement algorithms and proposes improved algorithm.Improved algorithm uses transaction reduction and hashing techniques.In the improved algorithm,the candidate item sets Ck are generated by backuping the database Dk,and the support of Ck is calculated at the same time.We use DHP algorithm to generate L2because generating frequent 2-itemset is the bottleneck.We compare improved algorithm and Apriori algorithm from the time complexity.The efficiency of impr... |
| |
| Keywords: | Apriori |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
