Data mining complexity » Historique » Version 4
François Rioult, 03/02/2011 20:36
| 1 | 1 | François Rioult | h1. Data mining complexity |
|---|---|---|---|
| 2 | |||
| 3 | 4 | François Rioult | !https://forge.greyc.fr/attachments/62/complex1.png!!https://forge.greyc.fr/attachments/64/result.png! |
| 4 | 2 | François Rioult | |
| 5 | 1 | François Rioult | This stream plots |
| 6 | * the time needed for mining frequent patterns |
||
| 7 | * the number of patterns depending on the minimum support. |
||
| 8 | |||
| 9 | The minsup varies with the help of a @for@ loop. |
||
| 10 | 2 | François Rioult | |
| 11 | 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. |
||
| 12 | 3 | François Rioult | |
| 13 | The inner part of the loop is: |
||
| 14 | !https://forge.greyc.fr/attachments/63/complex2.png! |