First page Back Continue Last page Summary Graphic
Association Rules
The problem of finding AR in a database can be broken in two subproblems:
- finding all frequent itemsets in the database (and their supports)
- finding all AR starting from the results obtained at the previous step
The first subproblem is the one that is computationally expensive.