International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 41 - Number 16 |
Year of Publication: 2012 |
Authors: C. Sathya, C. Chandrasekar |
10.5120/5627-7952 |
C. Sathya, C. Chandrasekar . Indexed Enhancement on GenMax Algorithm for Fast and Less Memory Utilized Pruning of MFI and CFI. International Journal of Computer Applications. 41, 16 ( March 2012), 37-41. DOI=10.5120/5627-7952
The essential problem in many data mining applications is mining frequent item sets such as the discovery of association rules, patterns, and many other important discovery tasks. Fast and less memory utilization for solving the problems of frequent item sets are highly required in transactional databases. Methods for mining frequent item sets have been implemented using a prefix-tree structure, known as an FP-tree, for storing compressed information about frequent item sets which is too large to fit in memory. GenMax, a search based algorithm is used for mining maximal frequent item sets. GenMax uses a number of optimizations to prune the search space. It uses a technique called progressive focusing to perform maximal checking, and differential set propagation to perform fast frequency computation. The proposal in this paper present an improved index based enhancement on GenMax algorithm for effective fast and less memory utilized pruning of maximal frequent item sets and closed frequent item sets. The proposed model reduce the number of disk I/Os and make frequent item set mining scale to large transactional databases. Experimental results shows a comparison of improved index based GenMax and existing GenMax for efficient pruning of maximal frequent and closed frequent item sets in terms of item precision and fastness.