Chapter 7

Data Mining Algorithms II: Frequent Item Sets

Dan A. Simovici

Dan A. Simovici

Department of Mathematics and Computer Science, University of Massachusetts at Boston, Boston, MA 02125, USA

Search for more papers by this author
First published: 01 March 2007

Summary

The identification of frequent item sets and of association rules have received a lot of attention in data mining due to their many applications in marketing, advertising, inventory control, and many other areas. First the notion of frequent item set is introduced and we study in detail the most popular algorithm for item set identification: the Apriori algorithm. Next we present the role of frequent item sets in the identification of association rules and examine the levelwise algorithms, an important generalization of the Apriori algorithm.

The full text of this article hosted at iucr.org is unavailable due to technical difficulties.