First page Back Continue Last page Summary Graphic
Association Rules
The problem of finding AR in a database refers to finding all AR in a database whose support is greater than a minimum support and whose confidence is greater than a minimum confidence. The minimum support and minimum confidence are specified by the user.
A set of items is called frequent if its support is greater than the minimum support. A frequent itemset that is maximal is called large.