THE GARDEN
Updated 02 Oct 2026
mines frequent patters using a compressed prefix-tree representation of transactions
the standard approach counts frequent items, builds an FP-tree, then mines conditional pattern bases and trees
avoids Apriori-style candidate generation
commonly uses two initial database passes; total efficiency depends on how well the data compress and how many patterns exist.
“Always faster” is too strong.
Unavailable reference
Apriori Algorithm
◌ Explore connections in Graph view
Paths through the garden