Discovering Frequent Patterns Mining Procedures
Poonam Sengar1, Bhagyshri Lachhwani2, Mehul Barot3
1Poonam Sengar, ME, Department of Computer Engineering, LDRP – ITR, Gandhinagar. India.
2Bhagyshri Lachhwani, ME, Department of Computer Engineering, LDRP- ITR, Gandhinagar. India.
3Prof. Mehul Barot, Department of Computer, Name, University LDRP – ITR, Gandhinagar. India.
Manuscript received on 09 January 2013 | Revised Manuscript received on 18 January 2013 | Manuscript Published on 30 January 2013 | PP: 97-100 | Volume-2 Issue-2, January 2013 | Retrieval Number: B0387012213 /2013©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Efficient algorithm to discover frequent pattern are crucial in data mining research. Finding frequent itemset is computationally the most expensive step in association rule discovery to address these issues we discuss popular techniques for finding frequent itemset in efficient way. In this paper we provide the survey list of existing frequent itemset mining techniques and its analysis.
Keywords: Association rules, data mining, frequent itemset, FPM, minimum support
Scope of the Article: Data Mining