MAFIA- A Maximal Frequent Itemset Algorithm

Johannes Gehrke

  1. MAFIA—A Maximal Frequent Itemset Algorithm
  2. Problem Introduction
  3. Informal Problem Introduction (Contd.)
  4. Applications of Frequent Itemsets
  5. Outline of the Talk
  6. The Itemset Lattice
  7. Frequent Itemsets
  8. Breadth First Search: 1-Itemsets
  9. Breadth First Search: 2-Itemsets
  10. Breadth First Search: 3-Itemsets
  11. Breadth First Search: Remarks
  12. Depth First Search (1)
  13. Depth First Search (2)
  14. Depth First Search (3)
  15. Depth First Search (4)
  16. Depth First Search (5)
  17. Depth First Search: Remarks
  18. BFS Versus DFS
  19. Head-Tail Framework
  20. Head-Tail Framework
  21. Outline of the Talk
  22. MAFIA: Simple Algorithm
  23. MAFIA: PEP (Parent equivalence pruning)
  24. MAFIA: FHUT (Frequent head-union-tail)
  25. MAFIA: HUTMFI (Check head-union-tail in the MFI)
  26. MAFIA: The Final Algorithm
  27. Implementation Details
  28. Implementation Details (2)
  29. Implementation Details: Compression
  30. Implementation Detail: HUTMFI
  31. Implementation Detail: HUTMFI (2)
  32. Performance Experiments
  33. Effect of Pruning Strategies
  34. Effect of Compression
  35. Performance Comparison with DP
  36. Comparison with DP
  37. Comparison with DP (2)
  38. Comparison with DP (3)
  39. Comparison With DP: Chess Data
  40. Number of Itemsets Found
  41. Related Work
  42. Questions?

Return to Format Selection

This document created with the Web Accessibility Wizard for Microsoft(R) Office.