Indexed Enhancement on GenMax Algorithm for Fast and Less Memory Utilized Pruning of MFI and CFI
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.