欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
对频繁模式树中的每个节点引入一个位串存储前缀路径,提出了包含正负项目的频繁模式树的构造方法,它不需要反复遍历节点就可获得包含正负项目的频繁项集.与直接使用FP-growth算法相比,无需对原始数据库进行负项目的扩展,也不用再构造并销毁额外的数据结构,只需在原始的频繁模式树上修改,因而在时空开销上都具有一定的优势.实验表明,所提出的算法比现有的同类挖掘算法和直接FP-growth算法具有更好的效率.
英文摘要：
A bit string for each node of the frequent pattern tree is imported to store the prefix.A method for constructing frequent pattern tree which contains positive and negative items is proposed,and frequent item sets with negative items are mined through extending frequent patterns on the tree.Comparing to direct using FP-growth algorithms,this algorithm needs not expand negative item to original database,and construct or destruct additional data structures,which only makes some changes on the original frequent pattern tree,so it has certain advantages in time and space costs.Experiments show that the algorithm has better efficiency than the existing similar mining algorithms and direct FP-growth algorithms.
同期刊论文项目
同项目期刊论文
期刊信息
位置：