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

Making Rain in India is a Necessity/Cloud Seeding

Water is the base of human life. Day by day water resources are decreasing and its uses are increasing. Rain is the main source of water and plays key role in agriculture. This paper concentrates on the scenario of rain...

Oblong Difference Mean Prime Labeling of Some Planar Graphs

The labeling of a graph, we mean assign some integers to the vertices or edges (or both) of the graph. Here the vertices of the graph are labeled with oblong numbers and the edges are labeled with mean of the absolute di...

Performance Evaluation of Mutual Funds and Unit Linked Insurance Plans in India: An Empirical Study of Equity-Based Funds

India is re-emerging as an economic power on the world stage with its rapidly growing economy becoming an investment led economy. Ever expanding impact of economic liberalization, privatization and globalization; growing...

Effectiveness of nursing in paediatrics unit: Reviewing culturally sensitive care and experiences of nurses on the patients’ health recovery.

Pediatric nurses are those nurses which care for children belonging to all age groups in a variety of healthcare settings. They possess ample knowledge about growth and development, as they are mainly involved in all rou...

Soft-Switched High Efficiency CCM Boost Converter with High Voltage Gain

This paper proposed for high efficiency converter with high voltage gain introducing a soft switch continues conduction mode (CCM) boost converter in applications such as dc back up energy system for UPS, photovoltaic, h...

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