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

Refining Credit Risk Analysis- Integrating Bayesian MCMC with Hamiltonian Monte Carlo

The accurate prediction of loan defaults is paramount for financial institutions to enhance decision-making processes, optimize loan approval rates, and mitigate associated risks. This study develops a predictive model u...

Deep Learning-based Classification of Materials into Biodegradable and Non-Biodegradable

The collection of real-time data from people, their cars, public transit, buildings, and other urban infrastructures like the energy grid and waste management systems are at the heart of the smart city concept. The insig...

Utilization of Admixtures in Self-Compacting High Performance Concrete

Flowable concrete or self-consolidating or self-compacting concrete (SCC) is a particularly flowable, non-segregating concrete which flows, plugs formwork, and captures the utmost congested rebars with none use of mechan...

Smart Crop-Field Monitoring and Irrigation System Based On IoT

Agriculture is critical to the growth of agrarian countries like India. Agriculture-related issues have long been a roadblock to the country's growth. Smart agriculture, which involves updating existing agricultural tech...

Potential of Soil Stabilization Using Ground Granulated Blast-Furnace Slag (GGBS)

Natural delicate soil also known as organic soft soil (OSS) has extensive negative geotechnical properties, for example, high water content, low shear strength, high natural matter, and low bearing limit and thus a criti...

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