| 基于数组的关联规则挖掘算法的研究 |
| |
| 引用本文： | 李敏,潘祥光,曲云波.基于数组的关联规则挖掘算法的研究[J].哈尔滨商业大学学报(自然科学版),2011,27(5):705-708. |
| |
| 作者姓名： | 李敏 潘祥光 曲云波 |
| |
| 作者单位： | 1. 哈尔滨商业大学计算机与信息工程学院哈尔滨150028
2. 哈尔滨工业美术设计学校,哈尔滨,150059 |
| |
| 基金项目： | 黑龙江省教育厅项目(11541083) |
| |
| 摘 要： | 频繁项集的挖掘效率是关联规则产生的关键.针对经典Apriori算法的瓶颈,提出一种改进算法,通过数组结构来保存项集信息,只须扫描一遍数据库减少了时间开销.在自连接前进行项目计数,减少参加连接的项集数量,减少了候选项集的数量.通过实例证明,改进算法的效率更高.
|
| 关 键 词： | 关联规则 频繁项集 Apfiori 数组 |
Research on association rules mining algorithm based on array |
| |
| LI Min,PAN Xiang-guang,QU Yun-bo.Research on association rules mining algorithm based on array[J].Journal of Harbin University of Commerce :Natural Sciences Edition,2011,27(5):705-708. |
| |
| Authors: | LI Min PAN Xiang-guang QU Yun-bo |
| |
| Institution: | LI Min1,PAN Xiang-guang1,QU Yun-bo2(1.School of Computer & Information Engineering,Harbin University of Commerce,Harbin 150028,China,2.Industry & Art Design School,Harbin 150059,China) |
| |
| Abstract: | The efficiency of mining complete set of frequent items remains a key factor to determine association rules.As to the bottlenecks of the Apriori algorithm,an improved method was put forward.The array was used to store items information,it just need once scans to database and reduce a mass of time.The improved method added a pruning process before connection,the number of candidate items could be reduced.The example showed that the improved algorithm was more efficient. |
| |
| Keywords: | association rules frequent items Apriori array |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
