| 基于前缀树的关联规则挖掘算法分析与设计 |
| |
| 引用本文： | 汪红,TU Min-qian.基于前缀树的关联规则挖掘算法分析与设计[J].计算机与现代化,2008(8):107-109. |
| |
| 作者姓名： | 汪红 TU Min-qian |
| |
| 作者单位： | 中南民族大学计算机科学学院,湖北,武汉,430074 |
| |
| 摘 要： | 通过研究项集之间的关系，发现大项集之间存在着一种特定的关系，即k-项集一定是由一个（k-1）-项集加上一个单独的项构成的。基于这种项集关系，本文提出基于前缀树的TIUA算法，算法摆脱了传统算法多次迭代的不足，并利用挖掘出的结果，只需扫描一次数据库，就能满足各种要求，通过以空间换时间，达到提高挖掘效率的目的。
|
| 关 键 词： | 数据挖掘 关联规则 增量挖掘 前缀树 |
Analysis and Design of Association Rules Data Mining Algorithm Based on Prefix Binary Tree |
| |
| WANG Hong,TU Min-qian.Analysis and Design of Association Rules Data Mining Algorithm Based on Prefix Binary Tree[J].Computer and Modernization,2008(8):107-109. |
| |
| Authors: | WANG Hong TU Min-qian |
| |
| Affiliation: | WANG Hong,TU Min-qian (College of Computer Science, South-Central University for Nationalities, Wuhan 430074, China) |
| |
| Abstract: | Through investigating the relation of itemsets,it is found that a specific relationship is existed in large itemsets,such as the k itemset consists of k-1 itemset and a single item.TIUA algorithm utilizes the specific relationship,getting rid of the shortage of traditional algorithm and utilizing result mined in the past fully,only needs to scan the database once,and meeting various requirements,through exchanging space for time,which gains the end of improving efficiency of data mining. |
| |
| Keywords: | data mining association rules incremental mining prefix binary tree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
