| 关联规则的快速提取算法 |
| |
| 引用本文： | 刘利峰,吴孟达.关联规则的快速提取算法[J].计算机工程,2008,34(5):63-65. |
| |
| 作者姓名： | 刘利峰 吴孟达 |
| |
| 作者单位： | 国防科技大学数学与系统科学系,长沙,410073 |
| |
| 摘 要： | 针对基于频繁项集的关联规则挖掘算法效率低，需要多次扫描数据库且生成冗余候选项集问题，该文利用频繁项集的Aprior性质和概念格的基本思想提出一种关联规则提取算法，利用极大频繁项集来进行规则提取，去除了多数冗余的候选项集，提高了提取效率。
|
| 关 键 词： | 关联规则 数据挖掘 频繁项集 概念格 提取 |
| 文章编号： | 1000-3428（2008）05-0063-03 |
| 收稿时间： | 2007-05-08 |
| 修稿时间： | 2007年5月8日 |
Fast Algorithm for Association Rules Extraction |
| |
| LIU Li-feng,WU Meng-da.Fast Algorithm for Association Rules Extraction[J].Computer Engineering,2008,34(5):63-65. |
| |
| Authors: | LIU Li-feng WU Meng-da |
| |
| Affiliation: | (Dept. of Math and System Science, National University of Defense Technology, Changsha 410073) |
| |
| Abstract: | Association rules mining is an important research branch in data mining. However, most algorithms based on frequent item sets have to scan databases many times, which reduces extraction efficiency. This paper presents an algorithm to find all maximal frequent item sets quickly. The algorithm is based on concept lattice and it can certify all frequent item sets efficiently, which avoids calculating the redundant item sets and improves the extraction efficiency. |
| |
| Keywords: | association rules data mining frequent item sets concept lattice extraction |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
