Fast mining Top-Rank-k frequent patterns by using Node-lists

作者：

Highlights：

• In this paper, we propose an efficient algorithm named NTK for mining Top-Rank-k frequent patterns.

• NTK employs Node-lists to represent patterns, implement the recommendation task.

• Experiment results on four real datasets show that NTK far outperforms state-of-the-art algorithms.

摘要

•In this paper, we propose an efficient algorithm named NTK for mining Top-Rank-k frequent patterns.•NTK employs Node-lists to represent patterns, implement the recommendation task.•Experiment results on four real datasets show that NTK far outperforms state-of-the-art algorithms.

论文关键词：Data mining,Pattern mining,Top-Rank-k frequent patterns,Node-list,Algorithm

论文评审过程：Available online 7 September 2013.

论文官网地址：https://doi.org/10.1016/j.eswa.2013.08.075