Discovering Non-Redundant Association Rules using MinMax Approximation Rules

Journal Title: Indian Journal of Computer Science and Engineering - Year 2012, Vol 3, Issue 6

Abstract

Frequent pattern mining is an important area of data mining used to generate the Association Rules. The extracted Frequent Patterns quality is a big concern, as it generates huge sets of rules and many of them are redundant. Mining Non-Redundant Frequent patterns is a big concern in the area of Association rule mining. In this paper we proposed a method to eliminate the redundant Frequent patterns using MinMax rule approach, to generate the quality Association Rules.

Authors and Affiliations

R. Vijaya Prakash , Dr. A. Govardhan , Prof. SSVN. Sarma

Keywords

Related Articles

PUBLISHING PATIENT DATA SET SECURELY THROUGH DIFFERENTIAL PRIVACY VIA WAVELET TRANSFORMS

Every organization stores a required data in the digital form. This data needs to be published due to the mutual benefits or due to the government rule. This data also has significant research value. While publishing a d...

SEGMENTATION OF OPTIC DISC IN FUNDUS IMAGES

Glaucoma is one of the leading eye diseases that cause blindness. Early detection of glaucoma is essential to minimize the risk of visual loss of diabetic patients. A standard procedure that is used for the detection of...

Predictive congestion control mechanism for MANET

In adhoc networks connection failure between source and destination often occurs, due to mobility of nodes. After every failure the connection between source and destination gets disconnected.The problem is while sending...

MOVING MACHINE TRANSLATION SYSTEM TO WEB

The paper presents an overview of an online system based on Punjabi to Hindi Machine translation system. The implementation of the system is roughly divided into two parts: the client side and the server side. On the cli...

CERTAIN APPROACHES FOR A COMPLETE MATHEMATICAL TEXTTO-SPEECH SYSTEM

This paper discusses the teaching - learning process of mathematical subjects made accessible to visually disabled students. It aims to provide users a friendly vocal interface with computer and allow visually impaired p...

Download PDF file
  • EP ID EP114581
  • DOI -
  • Views 157
  • Downloads 0

How To Cite

R. Vijaya Prakash, Dr. A. Govardhan, Prof. SSVN. Sarma (2012). Discovering Non-Redundant Association Rules using MinMax Approximation Rules. Indian Journal of Computer Science and Engineering, 3(6), 796-802. https://europub.co.uk/articles/-A-114581