Partition: Scan Database Only Twice Any itemset that is potentially frequent in db must be frequent in at least one of the partitions of db Scan 1: partition database and find local frequent patterns Scan 2: consolidate global frequent patterns A. Savasere, E. omiecinski, and s navathe. an efficient algorithm for mining association in large databases. In VLDB95 February 4, 2021 Data Mining: Concepts and TechniquesFebruary 4, 2021 Data Mining: Concepts and Techniques 20 Partition: Scan Database Only Twice ◼ Any itemset that is potentially frequent in DB must be frequent in at least one of the partitions of DB ◼ Scan 1: partition database and find local frequent patterns ◼ Scan 2: consolidate global frequent patterns ◼ A. Savasere, E. Omiecinski, and S. Navathe. An efficient algorithm for mining association in large databases. In VLDB’95