Author : R.Prabamanieswari 1
Date of Publication :29th March 2018
Abstract: Many algorithms and techniques are developed for enumerating itemsets from transactional databases. They produce a large number of frequent itemsets when the minimum support threshold is low and /or the dataset is dense. A large number of discovered patterns makes further analysis of generated patterns troublesome. Therefore, it is important to find a small number of representative patterns to best approximate all other patterns. This paper modifies the algorithm MinRPset for finding representative pattern sets. It follows the same concepts such as - covered and greedy method in MinRPset but, it uses NCFP-tree instead of CFP-tree for storing frequent itemsets in a compressed manner. The experiment results show that our algorithm gives better execution time to generate representative patterns sets for the mushroom dataset in an efficient manner comparing to the algorithm MinRPset
Reference :
-
- Pasquier N, Bastide Y, Taouil R and Lakhal, ―Pruning Closed Itemset Lattices for Association Rules‖, Proc. BDA conf., pp 177-196, 1998.
- Pasquier N, Bastide Y, Taouil R and Lakhal L, ―Efficient Mining of Association Rules using Closed Itemset Lattices‖, Information Systems, vol 24, No 1, pp 25-46,1999.
- Pasquier N, Bastide Y, Taouil R and Lakhal, ― Discovering frequent closed itemsets for association rules‖, In: Proc 7th Int Conf on Database Theory (ICDT’99), Jerusalem, Israel, pp 398–416,1999.
- Zaki M, ―Generating non-redundant association rules‖, In: Proc 2000 ACM SIGKDD Int Conf Knowledge Discovery in Database(KDD’00), Boston, USA, pp 34–43, 2000.
- J. Pei, J. Han, and R. Mao, ―CLOSET: An efficient algorithm for mining frequent closed itemsets‖,In ACM SIGMOD’00 Workshop on Research Issues in Data Mining and Knowledge Discovery, pp 21–30, 2000.
- J. Wang, J. Han and J. Pei, ―Closet+: Searching for the best strategies for mining frequent closed itemsets,‖ in Proc. KDD, New York, NY, USA, pp. 236–245, 2003. [
- Ng R, Lakshmanan LVS, Han J and Pang A, ―Exploratory mining and pruning optimizations of constrained associations rules‖, In: Proc 1998 ACMSIGMOD Int Conf Management of Data(SIGMOD’98), Seattle, USA, pp 13–24, 1998.