Subscribe Now Subscribe Today
Science Alert
 
Blue
   
Curve Top
Asian Journal of Information Management
  Year: 2007 | Volume: 1 | Issue: 1 | Page No.: 11-18
DOI: 10.3923/ajim.2007.11.18
 
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

Design of Algorithm for Frequent Pattern Discovery Using Lattice Approach

Sanjeev Sharma, Akhilesh Tiwari, Sudhir Sharma and K.R. Pardasani

Abstract:
Data mining has recently attracted considerable attention from database practitioners and researchers because of its applicability in many areas, such as decision support, market strategy and financial forecasts combing techniques from the fields of machine learning, statistics and database, data mining enables us to find out useful and invaluable information from huge databases. Mining of association rules has received much attention among the various data mining problems. Most algorithms for association rule mining are the variants of the basic Apriori algorithm. One characteristic of these Apriori-based algorithms is that candidate itemsets are generated in rounds, with the size of the itemsets incremented by one per round. The number of database scan required by Apriori-based algorithms thus depends on the size of the largest large itemsets. In this research we proposed a new candidate set generation algorithm, which generates candidate itemsets of multiple sizes at each iteration by taking input as suggested large itemsets.
PDF Fulltext XML References Citation Report Citation
 RELATED ARTICLES:
  •    Deploying Holistic Meta-modeling for Strategic Information System Alignment
  •    CFD-Mine: An Efficient Algorithm For Discovering Functional and Conditional Functional Dependencies
  •    A Survey on Frequent Pattern Mining: Current Status and Challenging Issues
  •    Frequent Browsing Patterns Mining Based on Dependency for Online Shopping
How to cite this article:

Sanjeev Sharma, Akhilesh Tiwari, Sudhir Sharma and K.R. Pardasani, 2007. Design of Algorithm for Frequent Pattern Discovery Using Lattice Approach . Asian Journal of Information Management, 1: 11-18.

DOI: 10.3923/ajim.2007.11.18

URL: https://scialert.net/abstract/?doi=ajim.2007.11.18

COMMENT ON THIS PAPER
 
 
 

 

 
 
 
 
 
 
 
 
 

 
 
 
 
 

Curve Bottom