Question: Suppose we use the CloSpan algorithm to find all closed sequential patterns from a sequence database with ( absolute ) minimum support 1 5 .
Suppose we use the CloSpan algorithm to find all closed sequential patterns from a sequence database with absolute minimum support During the mining process, we derive the following sequences along with the sizes of their projected DBs: : : Then we use the backward subpattern rule and the backward superpattern rule to prune redundant search space. Which of the projected DBs will remain after the pruning?
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
