| 一种定位子集的自顶向下挖掘算法研究 |
| |
| 引用本文： | 方刚,涂承胜,熊江. 一种定位子集的自顶向下挖掘算法研究[J]. 计算机工程与应用, 2011, 47(18): 142-145. DOI: 10.3778/j.issn.1002-8331.2011.18.041 |
| |
| 作者姓名： | 方刚 涂承胜 熊江 |
| |
| 作者单位： | 重庆三峡学院 数学与计算机科学学院，重庆 万州 404000 |
| |
| 摘 要： | 针对现有自顶向下挖掘算法的不足，即在非频繁项目产生子集时和修剪重复产生的子集时存在冗余计算，提出一种基于定位子集的自顶向下挖掘算法，其适合于挖掘较长频繁项目集;算法按自顶向下策略用定位子集的方法产生非频繁项的子集，并有效地修剪冗余子集和减少重复计算，提高了算法的效率。实验证明，与现有的自顶向下挖掘算法相比，该算法是快速而有效的。
|
| 关 键 词： | 定位子集 自顶向下 长频繁项目集 挖掘算法 |
| 修稿时间： | |
Research of top-down mining algorithm based on orientation subset |
| |
| FANG Gang,TU Chengsheng,XIONG Jiang. Research of top-down mining algorithm based on orientation subset[J]. Computer Engineering and Applications, 2011, 47(18): 142-145. DOI: 10.3778/j.issn.1002-8331.2011.18.041 |
| |
| Authors: | FANG Gang TU Chengsheng XIONG Jiang |
| |
| Affiliation: | College of Mathematics and Computer Science，Chongqing Three Gorges University，Wanzhou，Chongqing 404000，China |
| |
| Abstract: | Aiming at disadvantage of presented top-down mining algorithm that has redundant computing when non-frequent itemsets generate their subsets and prune some repeatedly generated subsets,an algorithm of top-down mining based on orien- tation subset is proposed,which is suitable for mining relative long frequent itemsets.The algorithm uses orientation subset to generate subsets of non-frequent itemsets by top-down strategy,which can efficiently prune redundant subsets and reduce repeatedly computing to improve its efficiency.Comparing with presented top-down mining algorithms,the experiments indicate that it is fast and efficient. |
| |
| Keywords: | orientation subset top-down long frequent itemsets mining algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载免费的PDF全文 |
