| 一种基于树的频繁模式挖掘算法 |
| |
| 引用本文： | 刘君强,潘云鹤. 一种基于树的频繁模式挖掘算法[J]. 系统工程理论与实践, 2003, 23(5): 108-112. DOI: 10.12011/1000-6788(2003)5-108 |
| |
| 作者姓名： | 刘君强 潘云鹤 |
| |
| 作者单位： | (1)浙江大学计算机科学与技术学院 浙江杭州310027;(2)杭州商学院计算机信息工程系,浙江杭州310035 |
| |
| 基金项目： | 浙江省自然科学基金 ( 60 2 1 40 )，国家 863计划 ( 2 0 0 2 AA1 2 1 0 64)，浙江省教育厅科技计划 ( 2 0 0 2 0 63 5) |
| |
| 摘 要： | 提出了一种基于树的频繁模式挖掘算法TBA-FP。它以树表示法压缩数据库所含模式信息，将挖掘问题转化为按深度优先策略构造频繁模式树，并引入了虚拟裁剪等优化技术。实验表明，TBA-FP挖掘“长”模式的时间效率与空间可伸缩性远远优于经典算法Apriori.
|
| 关 键 词： | 频繁模式 数据挖掘 海量数据库 |
| 文章编号： | 1000-6788(2003)05-0108-05 |
| 修稿时间： | 2002-03-15 |
A Tree-Based Frequent Pattern Mining Algorithm |
| |
| LIU Jun|qiang+{,},PAN Yun|he+. A Tree-Based Frequent Pattern Mining Algorithm[J]. Systems Engineering —Theory & Practice, 2003, 23(5): 108-112. DOI: 10.12011/1000-6788(2003)5-108 |
| |
| Authors: | LIU Jun|qiang+{ } PAN Yun|he+ |
| |
| Affiliation: | 1. College of Computer Science and Technology, Zheijiang University, Hangzhou 310027, China; 2. Department of Computer Science, Hangzhou University of Commerce, Hangzhou 310035, China) |
| |
| Abstract: | A tree|based algorithm for mining of frequent patterns, TBA|FP, is proposed in this paper. The term, tree|based, has two meanings. First, a tree|based representation is used to compress the pattern information in the database. Second, the mining process is regarded as a process of constructing a frequent pattern tree in depth first order. Optimizing techniques, such as pseudo clipping, is discussed. Experiments show that TBA|FP is much more efficient and scalable than the classical algorithm, Apriori. |
| |
| Keywords: | frequent patterns data mining very large databases |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《系统工程理论与实践》浏览原始摘要信息 |
|
点击此处可从《系统工程理论与实践》下载全文 |
