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

Analyzing Theoretical Basis and Inconsistencies of Object Oriented Metrics

Metrics help in identifying potential problem areas and finding these problems in the phase they are developed decreases the cost and avoids major ripple effects from these in later development stages. These days, Object...

Integer Formulation and Data Analysis of a Real-World Course Timetabling Problem

Belonging to the class of hard combinatorial optimization problems, educational timetabling problems are considered to be challenging and attractive to operation research community in recent years. In this paper, we inve...

Current Research Work on Routing Protocols for MANET: A Literature Survey

Mobile ad hoc networks (MANETs) are autonomously self-organized networks without infrastructure support. In a mobile ad hoc network, nodes move arbitrarily; therefore the network may experience rapid and unpredictable to...

Geographic information based Replication and Drop Routing (GeoRaDR): A Hybrid Message Transmission Approach for DTNs 

Several approaches have been proposed to perform routing in Delay/Disruption Tolerant Networks (DTNs) which has a random connectivity pattern. As the routing path from the source to destination will not be available alwa...

Comparison of Digital Water Marking methods

In Digital watermarking, image or video is embedded information data within an insensible form for human visual system but in a way that protects from attacks such as common image processing techniques. Spatial domain(Le...

Download PDF file
  • EP ID EP108046
  • DOI -
  • Views 116
  • 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