.png){kind=icon}
返回
Fast mining Top-Rank-k frequent patterns by using Node-lists
.png){kind=icon}
OA
AI
DOI：10.1016/j.eswa.2013.08.075.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Mining Top-Rank-k frequent patterns is an emerging topic in frequent pattern mining in recent years. In this paper, we propose a new mining algorithm, NTK, to mining Top-Rank-k frequent patterns. The NTK algorithm employs a data structure, Node-list, to represent patterns. The Node-list structure makes the mining process much efficient. We have experimentally evaluated our algorithm against two representative algorithms on four real datasets. The experimental results show that the NTK algorithm is efficient and is at least two orders of magnitude faster than the FAE algorithm and also remarkably faster than the VTK algorithm, the recently reported state-of-the-art algorithm for mining Top-Rank-k frequent patterns. (C) 2013 Elsevier Ltd. All rights reserved.
Keyword:
Data mining
Pattern mining
Top-Rank-k frequent patterns
Node-list
Algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
暂无机构信息
引用论文
分享收藏分享收藏High-utility pattern mining: A method for discovery of high-utility item sets.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏
查看更多内容