.png){kind=icon}
返回
An efficient algorithm for mining top-rank-k frequent patterns
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-015-0748-9.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Mining top-rank-k frequent patterns is a popular data mining task, which consists of discovering the patterns in a transaction database that belong to the k first ranks in terms of support. Although, several algorithms have been proposed for this task, it remains computationally expensive. To address this issue, this paper proposes a novel algorithm named BTK. It relies on a novel tree structure named TB-tree to store crucial information about frequent patterns. Moreover, BTK employs a new B-list structure to store information about patterns, and relies on subsume indexes to reduce the search space and speed up the discovery of top-rank-k frequent patterns. BTK also uses an early pruning strategy and an effective threshold raising mechanism. Additionally, BTK introduces two efficient procedures for respectively generating subsume indexes and intersecting B-lists. Extensive experiments were conducted on several datasets to evaluate the efficiency of the proposed algorithm. Results show that BTK is highly efficient and competitive.
Keyword:
Pattern mining
Top-rank-k frequent patterns
TB-tree
B-list
N-list
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.5
论文数:
7.6K
被引数:
1.7W
机构
引用论文
分享收藏Incremental high utility pattern mining with static and dynamic databases基于静态和动态数据库的增量式高效用模式挖掘.png)
APPLIED INTELLIGENCE
APPLIED INTELLIGENCEIF3.5
PREAI
分享收藏Index-BitTableFI: An improved algorithm for mining frequent itemsetsIndex-bittablefi: 一种改进的频繁项集挖掘算法
PREAI
分享收藏EIFDD: An efficient approach for erasable itemset mining of very dense datasetsAPPLIED INTELLIGENCE
APPLIED INTELLIGENCEIF3.5
PREAI
分享收藏
查看更多内容