An N-list-based algorithm for mining frequent closed patterns

作者：

Highlights：

• Two theorems for fast determining closed patterns based on N-list structure are presented.

• An N-list-based algorithm for mining closed patterns is then proposed.

• The proposed algorithm outperforms a number of classical algorithms in terms of runtime and memory usage in most cases.

摘要

•Two theorems for fast determining closed patterns based on N-list structure are presented.•An N-list-based algorithm for mining closed patterns is then proposed.•The proposed algorithm outperforms a number of classical algorithms in terms of runtime and memory usage in most cases.

论文关键词：Data mining,Frequent closed pattern,N-list structure

论文评审过程：Available online 2 May 2015, Version of Record 26 May 2015.

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