ENHANCEMENT OF INTERSECTING ALGORITHM USING PREFIXTREE FOR TRANSACTIONS IN IDENTIFICATION OF CLOSEDFREQUENT ITEM SETS IN DATA MINING

VeenitaGupta; Neeraj Kumar; Praveen Kumar

Authors

VeenitaGupta M.Tech (CS&E),Amity University Noida,India Author
Neeraj Kumar M.Tech (CS&E),Amity University Noida,India Author
Praveen Kumar Assistant Professor,Amity University Noida Author

Keywords:

closed item set, frequent item set mining, transaction, prefix tree

Abstract

Mining frequent itemsets is a fundamental task in data mining. Unfortunately the number of frequent itemsets describing the data is often too large to comprehend. This problem has been attacked by condensed representations of frequent itemsets that are subcollections of frequent itemsets containing only the frequent itemsets that cannot be deduced from other frequent itemsets in the subcollection, using some deduction rules. Most known frequent item set mining approaches enumerate candidate item sets, determine their support, and prune candidates that fail to reach the user-specified minimum support. Apart from this scheme we can use intersection approach for identifying frequent item set. The closed frequentitem sets can be represented as theintersection of some subset of the given transactions.As the transactional database increases, the size of prefix tree also grows which make it difficult to handle. Experiments have been done to find out the efficient memory utilization of prefix tree. An improvement has been suggested to reduce the total number of branches in the prefix tree leading to reduction in its size.

References

T. Uno, M. Kiyomi, and H. Arimura. Lcm ver. 2: Efficient mining algorithms for frequent/closed/maximal itemsets. In Proc. Workshop Frequent Item Set Mining Implementations (FIMI 2004, Brighton, UK), Aachen, Germany, 2004. CEUR Workshop Proceedings 126.

G. Grahne and J. Zhu. Reducing the main memory consumptions of FPmax* and FPclose. In Proc. Workshop Frequent Item Set Mining Implementations (FIMI 2004, Brighton, UK), Aachen, Germany, 2004. CEUR Workshop Proceedings 126.

Calders T, Garboni C, Goethals B (2010) Efficient pattern mining of uncertain data with sampling. In: Proceedings of the 14th Pacific-Asia conference on knowledge discovery and data mining (PAKDD 2010, Hyderabad, India), vol I. Springer, Berlin, pp 480–487.

B. Goethals and M. Zaki, editors. Proc. Workshop Frequent Item Set Mining Implementations (FIMI 2004, Brighton, UK), Aachen, Germany, 2004. CEUR Workshop Proceedings 126.

C. Borgelt and X. Wang. SaM: A split and merge algorithm for fuzzy frequent item set mining. In Proc. 13th Int. Fuzzy Systems Association World Congress and 6th Conf. of the European Society for Fuzzy Logic and Technology (IFSA/EUSFLAT'09, Lisbon, Portugal), Lisbon, Portugal, 2009. IFSA/EUSFLAT Organization Committee.

F. Pan, G. Cong, A. Tung, J. Yang, and M. Zaki. Carpenter: Finding closed patterns in long biological datasets. In Proc. 9th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining (KDD 2003, Washington, DC), pages 637-642, New York, NY, USA, 2003. ACM Press.

F. Pan, A. Tung, G. Cong, and X. Xu. Cobbler: Combining column and row enumeration for closed pattern discovery. In Proc. 16th Int. Conf. on Scientific and Statistical Database Management (SSDBM 2004, Santori Island, Greece), page 21, Piscataway, NJ, USA, 2004. IEEE Press.

G. Cong, K.-I. Tan, A. Tung, and F. Pan. Mining frequent closed patterns in microarray data. In Proc. 4th IEEE International Conference on Data Mining (ICDM 2004, Brighton, UK), pages 363-366, Piscataway, NJ, USA, 2004. IEEE Press.