Data mining complexity

This stream plots
  • the time needed for mining frequent patterns
  • the number of patterns depending on the minimum support.

The minsup varies with the help of a for loop.

This loop starts from the lowest minsup and goes to the highest minsup. The frequent patterns are then mined, counted and the time needed is computed. Finally, GNUplot generates a .PNG image plotting the results.

The inner part of the loop is:

complex1.png (11,7 ko) François Rioult, 03/02/2011 20:28

complex2.png (16,6 ko) François Rioult, 03/02/2011 20:28

result.png (7,04 ko) François Rioult, 03/02/2011 20:35