| 一种挖掘不确定性数据频繁项集的方法 |
| |
| 引用本文： | 郭乙江,钟智,元昌安,罗锦光.一种挖掘不确定性数据频繁项集的方法[J].广西师范学院学报(自然科学版),2011,28(1):100-104. |
| |
| 作者姓名： | 郭乙江 钟智 元昌安 罗锦光 |
| |
| 作者单位： | 广西师范学院计算机与信息工程学院,广西南宁,530023 |
| |
| 基金项目： | 广西自然科学重点基金: |
| |
| 摘 要： | 该文探讨挖掘不确定性数据频繁项集,在Carson Kai-Sang Leung等人提出的一种基于树的UFPgrowth算法的基础上进行改进,提出新算法-UFP-growthT.实验表明,该算法可以有效地挖掘不确定性数据的频繁项集,且拥有高效性和伸缩性.改进后的算法在一定程度上减小了UFP-tree的大小,加快了挖掘过程...
|
| 关 键 词： | 不确定性数据 U-Apriori 频繁模式 UFP-Tree |
Frequent Pattern Mining from Uncertain Data |
| |
| GUO Yi-jiang,ZHONG Zhi,YUAN Chang-an,LUO Jin-guang.Frequent Pattern Mining from Uncertain Data[J].Journal of Guangxi Teachers Education University:Natural Science Edition,2011,28(1):100-104. |
| |
| Authors: | GUO Yi-jiang ZHONG Zhi YUAN Chang-an LUO Jin-guang |
| |
| Institution: | ((College of computer and information engineering,Guangxi Teachers Education University,Nanning 530023,China) |
| |
| Abstract: | Frequent pattern mining of the uncertain data is improved based on a tree-based UFP-growth algorithm is proposed in Carson Kai-Sang Leung et al for a new algorithm-UFP-growthT.Experiments show that the algorithm can effectively mine uncertain data frequent pattern,and has high efficiency and retractility.The improved algorithm reduces to some extent,the size of UFP-tree,which speeds up the mining process. |
| |
| Keywords: | uncertain data U-Apriori frequent pattern UFP-tree |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
