A Fast Algorithm for Mining Multilevel Association Rule Based on Boolean Matrix

Journal Title: International Journal on Computer Science and Engineering - Year 2010, Vol 2, Issue 3

Abstract

In this paper an algorithm is proposed for mining multilevel ssociation rules. A Boolean Matrix based approach has been mployed to discover frequent itemsets, the item forming a ule ome from different levels. It adopts Boolean relational lculus to discover maximum frequent itemsets at ower level. When using this algorithm first time, it scans the atabase once and will generate the association rules. Apriori roperty is used in prune the item sets. It is not necessary to can the database again; it uses Boolean logical operation to enerate the multilevel association rules and also use op-down progressive deepening method.

Authors and Affiliations

Pratima Gautam , K. R. Pardasani

Keywords

Related Articles

Entropy Based Lossless Fractal Image Compression using Irregular Rectangular Partitions

Entropy of an image can be taken as a parameter of variation among pixel values. Equal value for all pixels in an image results in zero entropy. This idea is incorporated at the time of partitioning the image. Partitions...

IRIS RECOGNITION BASED ON GAUSSIAN-HERMITE MOMENTS

Iris recognition is accepted as one of the most efficient biometric method. Implementing this method to the practical system requires the special image preprocessing where the iris feature extraction plays a crucial role...

Modified Kalman Filter-based Approach in Comparison with Traditional Speech Enhancement Algorithms from Adverse Noisy Environments

The paper presents a new speech enhancement approach for a single channel speech enhancement in a noise environment. In this method speech is mixed with real-world noises from babble, car and street environments. In this...

Fast Background Subtraction from Video Sequences

This paper presents a technique to detect the moving objects quickly and accurately by using a background subtraction algorithm called FaBS (Fast Background Subtraction). The aim of FaBS is to distinguish between moving...

Web Services Security Architectures Composition and Contract Design using RBAC

Service Oriented Architecture’s Web Services authorization traditionally is done using common access control models like Role-Based Access Control. In thinking of a composite application that stitches together the capabi...

Download PDF file
  • EP ID EP108046
  • DOI -
  • Views 86
  • Downloads 0

How To Cite

Pratima Gautam, K. R. Pardasani (2010). A Fast Algorithm for Mining Multilevel Association Rule Based on Boolean Matrix. International Journal on Computer Science and Engineering, 2(3), 746-752. https://europub.co.uk/articles/-A-108046