Improving Efficiency of META Algorithm Using Record Reduction
Journal: INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY (Vol.8, No. 1)Publication Date: 2013-01-15
Authors : Shweta Bidhan; Kanwal Garg;
Page : 712-720
Keywords : META algorithm; data mining; frequent pattern mining; Apriori algorithm;
Abstract
Erasable Itemset Mining is the key approach of data mining in production planning. The erasable itemset mining is the process of finding erasable itemsets that satisfy the constraint i.e. user defined threshold. Efficient algorithm to mine erasable itemsets is extremely important in data mining. Since the META Algorithm was proposed to generate the erasable itemsets. In last few years there have been several methods to improve its performance. But they do not consider the time constraint. If database is large META takes too much time to scan the database. In this paper, Author purposed an Improved META (I-META) algorithm which reduces the scanning time by reduction of production records. It also reduces the redundant generation of sub-items during trimming the candidate itemsets, which can find directly the set of erasable itemsets and removing candidate having a subset that is not erasable.
Other Latest Articles
- EFFECT OF CHEMICAL REACTION ON MHD FLOW OF A VISCO-ELASTIC (WALTER'S LIQUID MODEL-B) FLUID THROUGH POROUS MEDIUM WITH HEAT SOURCE
- A NOVEL METHOD OF COLOR IMAGE ENHANCEMENT BY COLOR SPACE TRANSFORMATION FOLLOWED BY GAMMA/LOGARITHMIC TRANSFORMATION
- On the Performance of PF, MLWDF and EXP/PF algorithms in LTE
- A New Approach of Location Based Routing in MANETs
- Segmentation of Handwritten Text Document Written in Devanagri Script for Simple character, skewed character and broken character
Last modified: 2016-06-29 19:20:26