A Study of Frequent Item Set Mining Techniques
Issue: Vol.8 No.2
Authors:
Sachin Sharma (Manav Rachna International University, Faridabad)
Shaveta Bhatia (Manav Rachna International University, Faridabad)
Keywords: Association Rules, Frequent Item sets, Rare Item sets
Abstract:
Frequent item set is the most crucial and expensive task in the industry today. It is the task of mining the information from different sources and a key approach in Data Mining. Frequent item sets satisfying the minimum threshold can be discovered. Association rules are extracted from frequent item sets. The Association rules are affected by the minimum support value entered by the user may be considered as Positive or Negative. There may be some other Association rules which involve the rare item sets. Various methods have been used by researchers for generating the Association Rules. In this paper, our aim is to study various techniques to generate the Association rules.
References:
[1] Arpan Shah et al. (2014),’A Collaborative Approach of Frequent Item Set Mining: A Survey’, International Journal of Computer Applications, Volume 107, No 8
[2] Agrawal, R. &SrikantR. (1994), ‘Fast Algorithms for Mining Association rules’, Proc. 20th VLDB conference, Santiago, Chile
[3] Narra S. et al. (2014), ‘An efficient algorithm for mining coherent association rules’, International Journal of Computer Applications,Volume 6, No2
[4] Brin S. et al. ‘Beyond Market Baskets: Generalizing Association Rules to Correlations’, in Proceedings of the ACM SIGMOD Conference, pp. 265-276
[5] Fayyad U, (1997), ‘Data Mining and Knowledge Discovery in Databases: Implications from scientific databases’, In Proc. of the 9th Int. Conf. on Scientific and Statistical Database Management, Olympia, Washington, USA, pp. 2-11
[6] Park J. et al. (1995) , ’Effective Hash-Based Algorithm for Mining Association’, Proceedings of ACM SIGMOD International Conference on Management of Data, San Jose, CA, pp. 175 - 186
[7] Kumbhar S. L. et al. (2015), ‘Pattern discovery using Apriori and Ch- Search Algorithm’, International Journal of Computational Engineering Research, Volume 5, No 3
[8] K.Raja & Shiva Prasad T., ’Association Rule Mining using Apriori algorithm for food dataset’, available at https://www.academia.edu/ 8387094/ Association_Rule_ Mining_using_ Apriori_algorithm_For_food_dataset
[9] Manisha Kundal & Dr Parminder Kaur (2015), ’Various requent item set based on Data Mining Technique’, International Research Journal of Engineering and Technology, Volume 02, No 3
[10] Chen C. et al. (2014), ‘A Projection-based Approach for mining highly coherent Association rules’, Springer Publishing Switzerland
[11] Pei M. et al. ,‘Feature Extraction using genetic algorithm’, CaseCenter for Computer-aided Engineering and Manufacturing W., Department of Computer Science
[12] Ghosh S. et al. (2010), ‘Mining frequent item sets using Genetic Algorithm’, International Journal of Artificial Intelligence and Applications, Volume 1, No 4
[13] Sharma S. et al. (2011), ‘Efficiency of Spiral Model by applying Genetic Algorithm’, International Journal of Computer Science and Technology, Volume 2, No 2
[14] Sharma A. et al. (2012), ‘A Survey of Association Rule Mining Using Genetic Algorithm’, International Journal of Computer Applications and Information Technology, Volume 1, No 2
[15] Dandu S. et al. (2013),’ Improved Algorithm for Frequent Item sets Mining Based on Apriori and FP- Tree’, Global Journal of Computer Science and Technology Software & Data Engineering, Volume 13, No 2
[16] Kavya T & Sasikumar R (2015), ‘Finding of repeated item sets using Genetic Algorithm’, International Journal of Engineering Sciences & Research, Volume 4, No 7
[17] Patel U.K.(2016) ‘Optimization of Association Rule Mining using Genetic Algorithm’, Conference Proceeding of International Conference on Recent Innovation in Science, Technology and Management.
[18] Akilandeswari S. et al (2015), ‘A novel approach to mine infrequent weighted item set using coherent rule mining algorithm, Indian Journal of Innovations and Developments, Vol 4(3).