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 15. During the mining process, we derive the following sequences along with the sizes of their projected DBs: : 50,50,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?

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!