Research on a frequent maximal induced subtrees mining method based on the compression tree sequence

作者：

Highlights：

• Save the information of the original tree in the compression tree by CTS.

• For each round of iterative, compression can reduce the size of the dataset.

• Optimize maximal stage.

• The proposed algorithm CFMIS mines more frequent subtrees in less time.

摘要

•Save the information of the original tree in the compression tree by CTS.•For each round of iterative, compression can reduce the size of the dataset.•Optimize maximal stage.•The proposed algorithm CFMIS mines more frequent subtrees in less time.

论文关键词：Data mining,Frequent subtree,Induced subtree,Maximal subtree,Compression,CFMIS

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

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