An Efficient Algorithm to Mine Non Redundant Top K Association Rules

Abstract

Association rule mining is employed the foremost well-liked fiction within the field of analysis of knowledge mining. This paper presents a survey of some commonest techniques, that square measure often used for mining association rules from a knowledge set. Association mining may be a cardinal and advantageous researched data processing proficiency. However, looking on the choice of the arguments (the minimum support and minimum confidence), current algorithms will become terribly slow associated generate an exceptional large quantity of results or generate none or too few results, eliding helpful data, as a results of in apply users have restricted resources for analyzing the results and thus square measure usually only fascinated by discovering a particular amount of results, and fine standardization the parameters is time overwhelming. To handle this disadvantage, we tend to tend to propose associate formula to mine the top-k association rules, where k is that the variability of association rules to be found and is ready by the user. The formula utilizes a replacement approach for generating association rules named rule growths and includes several optimizations experimental results show that the formula has marvelous performance and quantify ability that it's associate advantageous completely different to classical association rule mining algorithms once the user would like to manage the number of rules generated.

Authors and Affiliations

Amardeep Kumar

Keywords

Related Articles

Secure Mining of Generalized Association Rules from Horizontally Distributed Databases

We consider the problem of secure mining of generalized association rules from horizontally distributed databases. Given a large horizontally distributed database of transactions, where each transaction consists of a set...

Students’ Knowledge of HIV/AIDS and their Attitude towards Sexual Behaviour- A Comparative study of Form 1 and Form 4 secondary school students in Coast Region, Kenya

National AIDS Control Council and the Ministry of Education Science and Technology in Kenya developed the 2004 Education Sector Policy on HIV and AIDS. The policy was intended to reduce HIV/AIDS infection and stigmatisat...

Efficient Spectrum Sensing for Cognitive Radio Networks via Joint Optimization of Sensing Threshold and Duration using MATLAB/SIMULINK

Frequency band is valuable in communication media. Different Telecommunication regularity authority have the rights to assign the spectrum to the users and the policy to assign spectrum till date is static frequency allo...

Detection of Spine Diseases by Feature Change in Aging Lumbar Spine Using Factor Analysis

The vertebrae’s and intervertebral discs form the axis of the skeleton which is said to be spine. The spine consists of 33 vertebrae’s which are grouped as five regions named as cervical region, thoracic region, lumbar r...

A Saliency Detection Model Based on Wavelet Transform Through Fusion of Color Spaces

Visual attention is studied by detecting a salient object in an input image. Visual attention is used in various image processing applications such as image segmentation, patch rarities, pattern recognition etc. In this...

Download PDF file
  • EP ID EP242781
  • DOI -
  • Views 101
  • Downloads 0

How To Cite

Amardeep Kumar (2016). An Efficient Algorithm to Mine Non Redundant Top K Association Rules. International journal of Emerging Trends in Science and Technology, 3(1), 3491-3500. https://europub.co.uk/articles/-A-242781