Suppose we use the CloSpan algorithm to find all closed sequential patterns from a sequence database with minimum support 15. During the mining process, we derive the following sequences along with the sizes of their projected DBs: : 50, 45, 30, : 30. Then we use the backward sub-pattern rule and the backward super-pattern rule to prune redundant search space. Which of the projected DBs will remain after the pruning?



Answer :

Other Questions