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

Analysis of Plate Girder Bridge for Class-AA Loadings (Tracked Vehicles)

A bridge is a means by which a road, railway or other service is carried over an obstacle such as a river, valley and other road or railway line, either with no intermediate support or with only a limited number of suppo...

Study on Strongly Pseudo Irregular Fuzzy Graphs

In this paper, Some results on Strongly pseudo Irregular Fuzzy Graphs and Strongly pseudo total Irregular Fuzzy Graphs are established. Comparative study between Strongly pseudo Irregular Fuzzy Graphs and Strongly pseudo...

An Algorithm for 2-Tuple Total Domination Number in Circulant Graphs

This paper studies perfect 2-tuple total domination number for the circulant graphs Cir(n, A) , where A ={1,2,...,x,n 1,n  2,...,n  x} and 1 2 n x         from an algorithmic point of view.

The Antibacterial Effect of Olive Leaf in Sudan

In vitro study of the antimicrobial activity of Olive Leaf Extracts (OLE) was done against five different bacterial human pathogens. One of gram positive (Staphyloccocus auras) and four gram negative (Proteus vlugaris, E...

An Improved Efficiency of Single Phase Transformer Less PV Inverter Topology by NPC System

This paper an improved efficiency of single phase transformer less PV inverter topology by neutral point clamping system proposes how to improve the efficiency of single phase PV inverter topology without using of transf...

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