An Algorithm for Finding Frequent Itemset based on Lattice Approach for Lower Cardinality Dense and Sparse Dataset
Journal Title: International Journal on Computer Science and Engineering - Year 2011, Vol 3, Issue 1
Abstract
Whenever mining association rules work for large data sets frequently itemset always play an important role and enhance the performance. Apriori algorithm is widely used for mining association rule which uses frequent item set but its performance can be improved by enhancing the performance of frequent itemsets. This paper proposes a new novel approach to finding frequent itemsets. The approach reduces a number of passes through an input data set in this paper from the study of data mining technology An Algorithm for Finding Frequent Itemset based on Lattice Approach for Lower Cardinality Dense and Sparse Dataset developed, by making variation in Apriori which improves performance over Apriori for lower cardinality. It does not follow generation of candidate-and-test method. It also reduces the scanning of database and needs only two scanning of database. The paper presents the results of experiments conducted to find how performance of association rule mining algorithm depends on the values of parameters i.e. number of transaction, cardinality and minimum support.
Authors and Affiliations
Ajay Acharya , Shweta Modi
Keywords
Related Articles
- EP ID EP145007
- DOI -
- Views 114
- Downloads 0
Color and Texture Based Identification and Classification of food Grains using different Color Models and Haralick features
This paper presents the study on identification and classification of food grains using different color models such as L*a*b, HSV, HSI and YCbCr by combining color and texture features without performing preprocessing. T...
Fast Pedestrian Detection using Smart ROI separation and Integral image based Feature Extraction
This paper discusses a fast pedestrian detection system for near infrared imaging system. The Advanced Driver Assistance Systems include pedestrian detection system to avoid accidents. Most pedestrian detection systems p...
Message Encryption Using Deceptive Text and Randomized Hashing
In this paper a new approach for message encryption using the concept called deceptive text is proposed.In this scheme we don’t need send encrypted plain text to receiver, instead, we send a meaningful deceptive text and...
IMPROVED ROUND ROBIN POLICY A MATHEMATICAL APPROACH
This work attempts to mathematically formulize the computation of waiting time of any process in a static -process, CPU-bound round robin scheme. That in effect, can calculate other performance measures also. An improv...
An Analysis on Preservation of Privacy in Data Mining
Privacy has become a key issue for progress in data mining. Maintaining the privacy of data mining has become ncreasingly popular because it allows sharing of privacy-sensitive data for analysis. So people are still rel...