Share Email Print
cover

Proceedings Paper

Using attribute value lattice to find closed frequent itemsets
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Finding all closed frequent itemsets is a key step of association rule mining since the non-redundant association rule can be inferred from all the closed frequent itemsets. In this paper we present a new method for finding closed frequent itemsets based on attribute value lattice. In the new method, we argue that vertical data representation and attribute value lattice can find all closed frequent itemsets efficiently, thus greatly improve the efficiency of association rule mining algorithm. We discuss how these techniques and methods are applied to find closed frequent itemsets. In our method, the data are represented vertically; each frequent attribute value is associated with its granule, which is represented as a hybrid bitmap. Based on the partial order defined between the attribute values among the databases, an attribute value lattice is constructed, which is much smaller compared with the original databases. Instead of searching all the items in the databases, which is adopted by almost all the association rule algorithms to find frequent itemsets, our method only searches the attribute-value lattice. A bottom-up breadth-first approach is employed to search the attribute value lattice to find the closed frequent itemsets.

Paper Details

Date Published: 21 March 2003
PDF: 9 pages
Proc. SPIE 5098, Data Mining and Knowledge Discovery: Theory, Tools, and Technology V, (21 March 2003); doi: 10.1117/12.486732
Show Author Affiliations
Tsau Young Lin, San Jose State Univ. (United States)
Xiaohua T. Hu, Drexel Univ. (United States)
Eric Louie, IBM Almaden Research Ctr. (United States)


Published in SPIE Proceedings Vol. 5098:
Data Mining and Knowledge Discovery: Theory, Tools, and Technology V
Belur V. Dasarathy, Editor(s)

© SPIE. Terms of Use
Back to Top