| 基于简单双矩阵的关联规则算法研究 |
| |
| 引用本文： | 沈良忠.基于简单双矩阵的关联规则算法研究[J].温州大学学报(社会科学版),2009(6):25-30. |
| |
| 作者姓名： | 沈良忠 |
| |
| 作者单位： | 温州大学城市学院,浙江温州325035 |
| |
| 摘 要： | 针对关联规则挖掘中传统Apriori算法需要通过多次扫描数据库来发现频繁项集的问题，提出一种基于简单双矩阵的方法来实现频繁项集的发现．该方法仅需要扫描数据库一次，并充分利用项集的出现次数和是否出现逻辑值来获取频繁项集．实验表明，该方法比Apriori算法更高效．
|
| 关 键 词： | 关联规则 矩阵 频繁项集 |
Association Rule Algorithm Based on Simple Two Matrixes |
| |
| SHEN Liangzhong.Association Rule Algorithm Based on Simple Two Matrixes[J].Journal of Wenzhou University Natural Science,2009(6):25-30. |
| |
| Authors: | SHEN Liangzhong |
| |
| Institution: | SHEN Liangzhong (City College, Wenzhou University, Wenzhou, China 325035) |
| |
| Abstract: | The identification of the frequent item sets in traditional Apriori algorithm of association rule mining needs to scan database many times. A algorithm based on simple two matrixes was proposed to identify the frequent item sets. The identification of the frequent item sets could be achieved by taking full use of the occurrence frequency and the logic value of occurrence after a scanning of database. The experimental results showed that the algorithm is more efficient than Apriori algorithm |
| |
| Keywords: | Association Rule Matrix Frequent Item Set |
| 本文献已被 维普 等数据库收录！ |
