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:
“It haunts me, the passage of time. I think time is a merciless thing. I think life is a process of burning oneself out and time is the fire that burns you. But I think the spirit of man is a good adversary.”
—Tennessee Williams (1914–1983)
“Interior design is a travesty of the architectural process and a frightening condemnation of the credulity, helplessness and gullibility of the most formidable consumers—the rich.”
—Stephen Bayley (b. 1951)
“That which endures is not one or another association of living forms, but the process of which the cosmos is the product, and of which these are among the transitory expressions.”
—Thomas Henry Huxley (1825–95)