Association rules algorithms
Focus on finding support for “itemsets”
The naïve method:
- Combine itemsets of size k-1 that differ only on the last item to find Candidatesk
- Measure support of itemsets from step 1 to form large itemsetk
- Increase k and repeat until no new large itemsets