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

Privacy Preserving Auditing and Data Recovery for Secure Cloud Storage

Cloud Storage permits users to remotely store their data and also provides users with on-demand self service from a shared pool of configurable and computable resources and that can be rapidly provisioned and realized wi...

Exploring the Synergy of Web Usage Data and Content Mining for Personalized Effectiveness

In light of the exponential growth of web data and user volume, individuals are increasingly overwhelmed by information overload on the internet. Addressing this challenge, our study focuses on enhancing web information...

Recognition of Indian Sign Languages

The focal point of this project is about developing a user interface to aid people who have hearing and speaking disabilities. This application would help in recognizing the different signs with respect to the single use...

Optimized LMS: A Solution to Online Learning in Covid-19

Over the world, school and universities have been closed for a considerable length of time. Instruction has ended up being principle worry in the midst of coronavirus emergency in the nation. At some point in the second...

Innovations in Healthcare through Computational Intelligence- A Study of Smart Technologies and AI

The use of Computational Intelligence in healthcare, explored in this thesis, has greatly advanced the digitization of medical services. Computational Intelligence enables computers to perform tasks that typically requir...

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