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

A Framework for Analyzing Software Quality using Hierarchical Clustering

Fault proneness data available in the early software life cycle from previous releases or similar kind of projects will aid in improving software quality estimations. Various techniques have been proposed in the literatu...

Performance evaluation of H.264 decoder on different processors

H.264/AVC (Advanced Video Coding) is the newest video coding standard of the moving video coding experts group. The decoder is standardized by imposing restrictions on the bit stream and syntax, and defining the process...

Handwritten Gurmukhi Character Recognition Using Statistical and Background Directional Distribution Features

In this manuscript handwritten Gurmukhi character recognition for isolated characters is proposed. We have used some statistical features like zonal density, projection histograms (horizontal, vertical and both diagonal)...

Impact Analysis of Recent DDoS Attacks

In the present era Internet has changed the way of traditional essential services such as banking, transportation, power, health, and defence being operated. These operations are being replaced by cheaper, more efficient...

A New Method for Generating All Positive and Negative Association Rules

Association Rule play very important role in recent scenario of data mining. But we have only generated positive rule, negative rule also useful in today data mining task. In this paper we are proposing “A new method for...

Download PDF file
  • EP ID EP145007
  • DOI -
  • Views 122
  • Downloads 0

How To Cite

Ajay Acharya, Shweta Modi (2011). An Algorithm for Finding Frequent Itemset based on Lattice Approach for Lower Cardinality Dense and Sparse Dataset. International Journal on Computer Science and Engineering, 3(1), 371-378. https://europub.co.uk./articles/-A-145007