| 基于树的不确定数据频繁项的挖掘算法研究 |
| |
| 引用本文： | 李学明,沈雪,王震.基于树的不确定数据频繁项的挖掘算法研究[J].世界科技研究与发展,2010,32(4):433-436. |
| |
| 作者姓名： | 李学明 沈雪 王震 |
| |
| 作者单位： | 重庆大学计算机学院,重庆400030 |
| |
| 摘 要： | 本文针对UF-growth算法在构建环节的不足,提出了一种改进的映射频繁项树PUF-tree算法。该算法基于数据库映射技术,通过改进原算法的构建过程,能在一定程度上消除原算法的性能瓶颈,提高算法的效率。
|
| 关 键 词： | 不确定数据 频繁项 期望支持度 |
Researches on Tree-based Frequent Pattern Mining from Uncertain Data |
| |
| LI Xueming,SHEN Xue,WANG Zhen.Researches on Tree-based Frequent Pattern Mining from Uncertain Data[J].World Sci-tech R & D,2010,32(4):433-436. |
| |
| Authors: | LI Xueming SHEN Xue WANG Zhen |
| |
| Institution: | ( College of Computer Science, Chongqing University, Chongqing 400030 ) |
| |
| Abstract: | According to the deficiency of the traditional UF-growth, an improved algorithm is introduced into the Projection Frequent Pattern Tree （PUF-tree） from Uncertain data. The PUF-tree method, based on the database projection technology, can avoid the bottleneck of the conventional algorithm and works more efficiently by using an improved tree constructing process. |
| |
| Keywords: | uncertain data frequent pattern expected support |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
