| 最大频繁项目集挖掘技术研究与展望 |
| |
| 引用本文： | 钱进.最大频繁项目集挖掘技术研究与展望[J].微计算机应用,2005,26(6):652-654. |
| |
| 作者姓名： | 钱进 |
| |
| 作者单位： | 江苏技术师范学院计算机科学与技术学院,常州,213001 |
| |
| 摘 要： | 提高最大频繁项目集挖掘算法的效率是关联规则挖掘研究一个重点领域.本文主要对影响最大频繁项目集挖掘效率的数据分布、搜索策略、支持度计算及剪枝策略等技术进行了研究,并对已提出的最大频繁项目集挖掘算法进行了分析.
|
| 关 键 词： | 数据挖掘 关联规则 最大频繁项目集 |
| 收稿时间： | 2004-06-07 |
| 修稿时间： | 2004-06-07 |
Research and Prospect on Technology of Maximum Frequent Itemsets Mining |
| |
| QIAN Jin.Research and Prospect on Technology of Maximum Frequent Itemsets Mining[J].Microcomputer Applications,2005,26(6):652-654. |
| |
| Authors: | QIAN Jin |
| |
| Affiliation: | Dept. of Computer Science and Technology, Jiangsu Teachers University of Technology, Changzhou, 213001, China |
| |
| Abstract: | Enhancing the efficiency of maximum frequent itemsets mining algorithm is an important area of researching association rule mining. This paper mainly describes the factors of effecting maximum frequent itemsets mining, such as data distribute, search strategy, support counting, pruning strategy. It also analyzes the proposed mining maximum frequent itemsets algorithms. |
| |
| Keywords: | data mining association rule maximum frequent itemsets |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
