Data mining complexity » Historique » Révision 4
Révision 3 (François Rioult, 03/02/2011 20:34) → Révision 4/5 (François Rioult, 03/02/2011 20:36)
h1. Data mining complexity !https://forge.greyc.fr/attachments/62/complex1.png!!https://forge.greyc.fr/attachments/64/result.png! !https://forge.greyc.fr/attachments/62/complex1.png! 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: !https://forge.greyc.fr/attachments/63/complex2.png!