...
机译:使用新颖的阈值提高和修剪策略来挖掘前k个高实用项集的有效算法
Hunan Univ, Coll Comp Sci & Elect Engn, Changsha 410082, Hunan, Peoples R China;
Hunan Univ, Coll Comp Sci & Elect Engn, Changsha 410082, Hunan, Peoples R China;
Harbin Inst Technol, Sch Nat Sci & Humanities, Shenzhen Grad Sch, Shenzhen 518055, Guangdong, Peoples R China;
Hunan Univ, Coll Comp Sci & Elect Engn, Changsha 410082, Hunan, Peoples R China|Hanoi Univ Ind, Fac Informat Technol, Hanoi, Vietnam;
High utility itemset mining; Top-k mining; Threshold raising strategies; Co-occurrence pruning; Transitive extension pruning; Coverage;
机译:使用有效的阈值提高策略挖掘top-k高实用项目集
机译:Top-K高平均实用商品符合有效修剪策略的挖掘
机译:挖掘Top-K高实用项目集的高效算法
机译:增强阈值提高策略,以有效挖掘top-k高效模式
机译:在某些不确定数据库中频繁进行顺序模式和项集数据挖掘的新算法。
机译:复杂网络中Top-k节点的快速高效挖掘算法
机译:高实用程序项目集与Top-K Chud(TCHUD)算法挖掘