| 挖掘关联规则Apriori算法的一种改进 |
| |
| 引用本文： | 袁剑,;王文海.挖掘关联规则Apriori算法的一种改进[J].青岛化工学院学报(自然科学版),2008(5):448-451. |
| |
| 作者姓名： | 袁剑 ;王文海 |
| |
| 作者单位： | [1]西安音乐学院基础部,陕西西安710061; [2]西安工业大学数理系,陕西西安710032 |
| |
| 摘 要： | 本研究在对Apriori算法分析的基础上,提出了改进的Apriori算法。改进后的算法采用矩阵表示数据库,减少了扫描事物数据库的次数;利用向量运算来实现频繁项集的计数,同时及时地去掉不必要的数据,减少了数据运算,从而提高了算法的运行效率。
|
| 关 键 词： | 数据挖掘 关联规则 频繁项集 Apriori算法 |
An Improved Aprior Algorithm Based on Mining Association Rule |
| |
| Institution: | YUAN Jian, WANG Wen-hai (1. Department of Fundamental Courses, Xi＇an Conservatory of Music, Xi＇an 710061 ,China 2. Department of Mathematics and Physics, Xi＇an Technological University, Xi＇an 710032, China) |
| |
| Abstract: | Based on analysis of the classical Apriori algorithm in mining association rule, this paper presents an improved Apriori algorithm to increase the efficiency of generating association rules. The improved algorithm adopts matrix to express database, which can reduce the times of database scanning . The improved algorithm use vectors operation to count frequent item sets and get rid of unwanted data simultaneously. Redundant data are deleted in time to improve the Apriori algorithm. |
| |
| Keywords: | data mining association rule frequent item sets Apriori algorithm |
| 本文献已被 维普 等数据库收录！ |
|
