Process
Association rules are usually required to satisfy a user-specified minimum support and a user-specified minimum confidence at the same time. Association rule generation is usually split up into two separate steps:
- First, minimum support is applied to find all frequent itemsets in a database.
- Second, these frequent itemsets and the minimum confidence constraint are used to form rules.
While the second step is straightforward, the first step needs more attention.
Finding all frequent itemsets in a database is difficult since it involves searching all possible itemsets (item combinations). The set of possible itemsets is the power set over and has size (excluding the empty set which is not a valid itemset). Although the size of the powerset grows exponentially in the number of items in, efficient search is possible using the downward-closure property of support (also called anti-monotonicity) which guarantees that for a frequent itemset, all its subsets are also frequent and thus for an infrequent itemset, all its supersets must also be infrequent. Exploiting this property, efficient algorithms (e.g., Apriori and Eclat) can find all frequent itemsets.
Read more about this topic: Association Rule Learning
Famous quotes containing the word process:
“A process in the weather of the world
Turns ghost to ghost; each mothered child
Sits in their double shade.
A process blows the moon into the sun,
Pulls down the shabby curtains of the skin;
And the heart gives up its dead.”
—Dylan Thomas (1914–1953)
“The practice of S/M is the creation of pleasure.... And that’s why S/M is really a subculture. It’s a process of invention. S/M is the use of a strategic relationship as a source of pleasure.”
—Michel Foucault (1926–1984)
“A process of genocide is being carried out before the eyes of the world.”
—Pope John Paul II (b. 1920)