Multilevel Association Rule

Abstract

The problems of developing models and algorithms for multilevel association mining pose for new challenges for mathematics and computer science. These problems become more challenging when some form of uncertainty in data or relationships in data exists. In this , we present a partition technique for the multilevel association rule mining problem. Taking out association rules at multiple levels helps in discovering more specific and applicable knowledge. In multilevel association rule there are two methods Boolean matrix and Hash based method. A Boolean Matrix based approach has been employed to discover frequent itemsets, the item forming a rule come from different levels. It adopts Boolean relational calculus to discover maximum frequent itemsets at lower level. When using this algorithm first time, it scans the database once and will generate the association rules. Apriori property is used in prune the item sets. It is not necessary to scan the database again; it uses Boolean logical operation to generate the multilevel association rules and also use top-down progressive deepening method. Hash-based algorithm for the candidate set generation. Explicitly, the number of candidate 2-itemsets generated by the proposed algorithm is, in orders of magnitude, smaller than that by previous methods, thus resolving the performance bottleneck. Note that the generation of smaller candidate sets enables us to effectively trim the transaction database size at a much earlier stage of the iterations, thereby reducing the computational cost for later iterations significantly. Extensive simulation study is conducted to evaluate performance of the proposed algorithm.

Authors and Affiliations

Monali Deshmukh, Madhu Nashipudimath

Keywords

Related Articles

A Comparative Study of Cat Swarm Algorithm for Graph Coloring Problem: Convergence Analysis and Performance Evaluation

The Graph Coloring Problem (GCP) is a significant optimization challenge widely suitable to solve scheduling problems. Its goal is to specify the minimum colors (k) required to color a graph properly. Due to its NP-compl...

The Electricity Creation by the Means of Hydro Power Plant

Energy can be produced in a variety of ways, and electricity is one of them. Hydropower plants produce electricity from water, thermal power plants produce electricity from heat, wind energy power plants produce electric...

A Review on Increasing Soil Carbon Storage: Mechanisms, Effects of Agricultural Practices and Proxies

The worldwide 4 per 1000 project seeks to assist governments and non-governmental organizations in their efforts to improve soil carbon (C) stock management. These stocks are depending on soil C emissions and inputs. The...

Pyrolysis of Municipal Solid Waste (MSW) For Biofuel Production: An Analysis of the Impacts of MSW Components and Catalysts

With the awareness of the depletion of fossil fuels, research into alternative energy sources has begun. Biomass is a sustainable energy source that may be used to make biofuels. These biofuels are then utilized to gener...

A Stacked Ensemble Framework for Detecting Malicious Insiders

One of the mainstream strategies identified for detecting Malicious Insider Threat (MIT) is building stacking ensemble Machine Learning (ML) models to reveal malevolent insider activities through anomalies in user activi...

Download PDF file
  • EP ID EP749454
  • DOI -
  • Views 19
  • Downloads 0

How To Cite

Monali Deshmukh, Madhu Nashipudimath (2014). Multilevel Association Rule. International Journal of Innovative Research in Computer Science and Technology, 2(1), -. https://europub.co.uk/articles/-A-749454