A Proficient Algorithm For Mining Frequent Item Sets
M Vanitha, D Narasimhan2

1M Vanitha, Department of CSE, SASTRA Deemed to be UniversityKumbakonam, Tamilnadu, India.
2D Narasimhan, Department of Mathematics, SASTRA Deemed to be University, Kumbakonam, Tamilnadu, India.
Manuscript received on 26 August 2019. | Revised Manuscript received on 06 September 2019. | Manuscript published on 30 September 2019. | PP: 3096-3099 | Volume-8 Issue-11, September 2019. | Retrieval Number: K24920981119/2019©BEIESP | DOI: 10.35940/ijitee.K2492.0981119
Open Access | Ethics and 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: Frequent Item set Mining (FIM) discover recurrent item sets that are extremely associated in a transactional database. It can be used in big data applications like gene extraction, social network analysis, IOT devices sensor data analysis, etc. As the data size keeps on growing, an efficient procedure is necessary to process the enormous volume of data. Apriori is one of the topmost algorithm and its entry enhanced the research in mining. The algorithm requires multiple scans of the database and produce more candidate items, which increase the computation time and storage along with the transactions size. An efficient technique is required to boost the performance of the algorithm in terms of storage and computational complexity. To reduce the complexity we proposed a reduction factor to Apriori and it can be adopted before candidate generation. Experimental results revealed that our proposed technique greatly reduce the total execution time as well as storage requirements.
Keywords: Frequent Item set Mining, Apriori algorithm, Association rule.
Scope of the Article: Data Mining