Mining top-k frequent-regular closed patterns

作者：

Highlights：

• Mining top-k frequent-regular closed patterns with minimal length is proposed.

• A new compact bit-vector representation is designed.

• An efficient single-pass algorithm is proposed.

摘要

•Mining top-k frequent-regular closed patterns with minimal length is proposed.•A new compact bit-vector representation is designed.•An efficient single-pass algorithm is proposed.

论文关键词：Frequent pattern,Regular pattern,Closed pattern,Bit-vector

论文评审过程：Available online 24 June 2015, Version of Record 2 July 2015.

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