A Gleam of Light on Association Rule Mining and Reduction Techniques
- Department of Computer Science,Sacred Heart College, Chalakudy.
- Department of CSE, KIT–Kalaignarkarunanidhi Institute ofTechnology,Coimbatore.
- Department of Computer Science,S.N.R. Sons College (Autonomous),Coimbatore.
116 Downloads
168 Views
Abstract
Association Rule Mining (ARM) algorithms generate an exceptionally large number of association rules, often in thousands or even millions. Further, the association rules are sometimes very extensive. The nearly impossible task of the end - users to comprehend or validate such large number of complex association rules and limits the usefulness of outcome of mining on massive data sources. Various strategies have been proposed to reduce the number of association rules. They include generating only “non-redundant” rules, generating only “interesting” rules, or generating only those rules satisfying certain other criteria such as coverage, leverage, lift or strength or pruning out ‘irrelevant’ rules. This paper presents the various methods used to solve the issue of association rule reduction.
Keywords
How to Cite This Article
Mini T V, R Nedunchezhian and V Vijayakumar (2016); A Gleam of Light on Association Rule Mining and Reduction Techniques, International Journal of Advanced Research (IJAR), 4 (08), 1-9, ISSN 2320-5407.
Corresponding Author
Article Analytics
This work is licensed under a Creative Commons Attribution 4.0 International License.





