| 09:00 | Welcome, introduction, results of the global experiments, Award |
| 10:30 | Coffee break |
| 11:00 | Panel Session I (session chair: Osmar Zaïane) |
| "A fast APRIORI implementation", by Ferenc Bodon | |
| "Efficient Implementations of Apriori and Eclat", by Christian Borgelt | |
| "Detailed Description of an Algorithm for Enumeration of Maximal Frequent Sets with Irredundant Dualization", by Takeaki Uno and Ken Satoh | |
| "Probabilistic Iterative Expansion of Candidates in Mining Frequent Itemsets", by Attila Gyenesei and Jukka Teuhola | |
| "Intersecting data to the closed sets with constraints", by Taneli Mielikäinen | |
| 12:30 | Lunch (included in registration) |
| 14:00 | Panel Session II (session chair: Bart Goethals) |
| "ARMOR: Association Rule Mining based on ORacle", by Vikram Pudi and Jayant Haritsa | |
| "AIM: Another Itemset Miner", by Amos Fiat and Sagi Shporer | |
| "LCM: An Efficient Algorithm for Enumerating Frequent Closed Item Sets", by Takeaki Uno, Tatsuya Asai, Yuzo Uchida, and Hiroki Arimura | |
| "MAFIA: A Performance Study of Mining Maximal Frequent Itemsets", by Doug Burdick, Manuel Calimlim, Jason Flannick, Johannes Gehrke, and Tomi Yiu | |
| "kDCI: a Multi-Strategy Algorithm for Mining Frequent Sets", by Salvatore Orlando, Claudio Lucchese, Paolo Palmerini, Raffaele Perego, and Fabrizio Silvestri | |
| 15:30 | Coffee break |
| 16:00 | Panel Session III (session chair: Christian Borgelt) |
| "Apriori, a depth-first implementation", by Walter A. Kosters and Wim Pijls | |
| "An Efficient Implementation of Pattern Growth Approach", by Guimei Liu, Hongjun Lu, Jeffrey Xu Yu, Wang Wei, and Xiangye Xiao | |
| "Efficiently Using Prefix-trees in Mining Frequent Itemsets", by Gösta Grahne and Jianfei Zhu | |
| "COFI-tree Mining: A New Approach to Pattern Growth with Reduced Candidacy Generation", by Osmar R. Zaïane and Mohammed El-Hajj | |
| "Mining Frequent Itemsets using Patricia Tries", by Andrea Pietracaprina and Dario Zandolin | |
| 17:30 | Concluding remarks |