A classic algorithm for finding frequent itemsets in a transactional dataset. It uses a 'bottom-up' approach, extending frequent subsets one item at a time (e.g., if {beer} is frequent, check {beer, diapers}).
Agrawal and Srikant (1994).
Foundational to modern recommendation engines.