| 基于二进制表示的频繁项集挖掘算法 |
| |
| 引用本文： | 徐峰. 基于二进制表示的频繁项集挖掘算法[J]. 现代计算机, 2008, 0(4): 13-16 |
| |
| 作者姓名： | 徐峰 |
| |
| 作者单位： | 济宁职业技术学院计算机工程系,济宁272000 |
| |
| 摘 要： | 发现频繁项集是关联规则挖掘中最基本、最重要的问题.提出了一种基于二进制表示的频繁项集挖掘算法,并利用二进制的性质快速产生候选项集并计算其支持度.算法总体性能在一定程度上得到了提高.
|
| 关 键 词： | 频繁项集 关联规则 二进制 数据挖掘 |
| 修稿时间： | 2007-11-16 |
Algorithm of Mining Frequent Itemsets Based on Binary Representation |
| |
| XU Feng. Algorithm of Mining Frequent Itemsets Based on Binary Representation[J]. Modem Computer, 2008, 0(4): 13-16 |
| |
| Authors: | XU Feng |
| |
| Affiliation: | XU Feng (Department of Computer Engineering,Jining Vocational & Technical College,Jining 272000) |
| |
| Abstract: | Discovery of frequent itemsets is the most fundamental and important problem in mining association rules. Proposes an algorithm based on binary representation makes use of the function of binary system, the algorithm can generate candidate itemsets and count their supports efficiently. Compared with the current algorithms, the function of this algorithm can be improved in some degree. |
| |
| Keywords: | Frequent Itemsets Association Rules Binary System Data Mining |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
