Open Access Journal

ISSN : 2394-2320 (Online)

International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Monthly Journal for Computer Science and Engineering

Open Access Journal

International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Monthly Journal for Computer Science and Engineering

ISSN : 2394-2320 (Online)

Modified Map Reduce Algorithm for Frequent Itemset Mining in Big Data

Author : K.Premchander 1 S.S.V.N.Sarma 2 Dr.S.Nagaprasad 3

Date of Publication :18th April 2018

Abstract: Frequent Pattern Mining (FPM) is one of the most well-known techniques to extract frequent patterns from data. It plays an important role in association rule mining, finding correlations and trends etc. Finding Frequent Patterns becomes a very difficult task when they are applied to Big Data. Many researchers have proposed many algorithms to generate FIM, but the execution time and storage space plays a key difference .All the existing algorithms hold well only when the dataset is small. So there is a need to propose an efficient algorithm to find frequent itemsets from Big Dataset using constraints. In almost all FPM algorithms, Frequent 1-itemsets are generated to find the support count (occurrences) of each item in the entire database In order increase the efficiency of generating FIM, cache is introduced so that the support count can be calculated in the cache itself. For this a Modified Map Reduce algorithm has been proposed.

Reference :

    1. 1. Agrawal, R. and Shafer, J. C. "Parallel Mining of Association Rules", IEEE Transaction on Knowledge and Data Eng. , Vol. 8, No. 6, pp. 962- 96, 1996.
    2. Agrawal, R. and Srikanth, R. “Fast algorithm for mining association rules”, International conference on Very large databases, 1994.
    3.  Alzoubi, W. A., Abu, Bakar, A. and Omar, K. “Scalable and Efficient Method for Mining Association Rules” International Conference on Electrical Engineering and Informatics, pp. 5-7, 2009.
    4. Bakshi, K. “Considerations for Big Data: Architecture and approach”, in Aerospace conference, IEEE Aerospace Conference, pp. 1-7, 2012.
    5. Banga, Devender and Cheepurisetti, S. “Proxy Driven FP growth based Prefetching”, International Journal of Advances in Engineering and Technology, 2014.
    6. Do, T. D., Hui, S. C. and Fong, A. C. M. “Mining FequentItemsets with Category-Based Constraints”, In the proceedings of 6th International Conference on Discovery Science, 2003.
    7. Dong, Jie and Han, M. “BitTableFI: An efficient mining frequent itemsets algorithm”, Knowledge based Systems, Elsevier, 2006.
    8. Duggal, Puneet, Singh and Paul, S. “Big Data Analysis: Challenges and Solutions” in International Conference on Cloud, Big Data and Trust, RGPV, pp. 269-276, 2013.
    9. Elteir, M., Lin, H. and Chun, Feng, W. “Enhancing MapReduce via asynchronous data Processing” in IEEE 16th International Conference on Parallel and Distributed Systems, pp. 397–405, 2010.

Recent Article