| 一种基于矩阵的强关联规则生成算法* |
| |
| 引用本文： | 吕桃霞,刘培玉.一种基于矩阵的强关联规则生成算法*[J].计算机应用研究,2011,28(4):1301-1303. |
| |
| 作者姓名： | 吕桃霞 刘培玉 |
| |
| 作者单位： | 山东师范大学,信息科学与工程学院,济南,250014;山东省分布式计算机软件新技术重点实验室,济南,250014 |
| |
| 基金项目： | 国家自然科学基金资助项目、山东省高新自主创新专项工程、山东省自然科学基金 |
| |
| 摘 要： | 针对Apriori算法扫描数据库的I/O代价和候选项集数目较多等问题，提出一种基于矩阵的强关联规则生成算法，算法通过将事务数据库转化为0-1矩阵后对项集按照支持度计数非递减顺序排列，从而减少候选项集的产生，同时实现置信度的高效计算。通过对实例和大数据量数据库的分析表明，该方法是有效的。
|
| 关 键 词： | 关联规则 排序矩阵 候选项集 频繁项集 置信度 |
| 收稿时间： | 8/21/2010 9:07:22 AM |
| 修稿时间： | 2011/3/14 0:00:00 |
Algorithm for generating strong association rules based on matrix |
| |
| LV Tao-xi,LIU Pei-yu.Algorithm for generating strong association rules based on matrix[J].Application Research of Computers,2011,28(4):1301-1303. |
| |
| Authors: | LV Tao-xi LIU Pei-yu |
| |
| Affiliation: | (College of Computer Science & Engineering, Chongqing University of Technology, ChongQing 400054, China) |
| |
| Abstract: | Apriori, the classic association rule mining algorithm, has the problems of higher I/O cost and more candidate itemsets in the process of finding out the frequent itemsets. Here, a new algorithm generating strong association rules based on matrix is proposed. The new algorithm could only scan the database for one time to convert the transactions into matrix which is composed by 0 and 1, and can be reordered by item support count non-descending order to reduce the number of candidate itemsets, meanwhile, the efficiency of association rule confidence computing can be enhanced too. The analysis results of examples and large database show that the proposed method is effective. |
| |
| Keywords: | association rule ordered matrix candidate itemsets frequent itemsets confidence |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用研究》浏览原始摘要信息 |
|
点击此处可从《计算机应用研究》下载全文 |
|
