An efficient and effective algorithm for mining top-rank-k frequent patterns

作者：

Highlights：

• Using N-list structure for mining top-rank-k frequent patterns effectively.

• Subsume concept was also used to speed up the runtime of the mining process.

• The experiment was conducted to show the effectiveness of the proposed algorithm.

摘要

•Using N-list structure for mining top-rank-k frequent patterns effectively.•Subsume concept was also used to speed up the runtime of the mining process.•The experiment was conducted to show the effectiveness of the proposed algorithm.

论文关键词：Data mining,Pattern mining,Top-rank-k frequent patterns,N-list

论文评审过程：Available online 7 August 2014.

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