Meta itemset: a new concise representation of frequent itemset |
| |
| Authors: | Wei Song Jinhong Li Zhangyan Xu |
| |
| Affiliation: | 1. College of Information Engineering , North China University of Technology , Beijing 100144, China sgyzfr@yahoo.com.cn;3. College of Information Engineering , North China University of Technology , Beijing 100144, China;4. Department of Computer , Guangxi Normal University , Guilin 541004, China |
| |
| 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. |
| |
| Keywords: | data mining association rule closed itemset maximal itemset meta itemset |
|
|
