Back to Search
Start Over
Meta itemset: a new concise representation of frequent itemset.
- Source :
- Journal of Experimental & Theoretical Artificial Intelligence; Dec2009, Vol. 21 Issue 4, p259-272, 14p, 1 Diagram, 2 Charts, 2 Graphs
- Publication Year :
- 2009
-
Abstract
- The sheer size of all frequent itemsets is one challenging problem in data mining research. Based on both closed itemset and maximal itemset, meta itemset which is a new concise representation of frequent itemset is proposed. It is proved that both closed itemset and maximal itemset are special cases of meta itemset. The set of all closed itemsets and the set of all maximal itemsets form the upper bound and the lower bound of the set of all meta itemsets. Then, property and pruning strategies of meta itemset are discussed. Finally, an efficient algorithm for mining meta itemset is proposed. Experimental results show that the proposed algorithm is effective and efficient. [ABSTRACT FROM AUTHOR]
- Subjects :
- DATA mining
OLAP technology
DATABASE searching
ALGORITHMS
ARTIFICIAL intelligence
Subjects
Details
- Language :
- English
- ISSN :
- 0952813X
- Volume :
- 21
- Issue :
- 4
- Database :
- Complementary Index
- Journal :
- Journal of Experimental & Theoretical Artificial Intelligence
- Publication Type :
- Academic Journal
- Accession number :
- 49234255
- Full Text :
- https://doi.org/10.1080/09528130902723690