High Impact Factor : 4.396 icon | Submit Manuscript Online icon |

Incremental Map Reduce Framework for Efficient Mining Evolving In Big Data Environment

Author(s):

Hasmitha.D , Velmmal Institute of Technology; Dhanya Krishnan P.K, Velmmal Institute of Technology; Lekha.L, Velmmal Institute of Technology; Kalpana A.V, Velmmal Institute of Technology

Keywords:

Map Reduce, Data mining, incremental process, Bipartite graph, computation, iteration

Abstract

Keeping in mind the constant growth of data, we require more efficient ways to store and retrieve data. As the data mining techniques that are currently being used become ineffective, new methods or some modifications in the application of the existing techniques becomes a necessity. In this project, the data mining technique that is being used is incremental Map reduce. When the volume of data increases, the computation process becomes tedious. To avoid this problem and to increase the efficiency of data mining we can make use of incremental map reduce process. Wherein, the past output is used to find the key-value pair rather than working from the scratch every time using the Bipartite Graph. By iterating the MapReduce process we can handle dynamic changes in the data efficiently.

Other Details

Paper ID: IJSRDV4I10607
Published in: Volume : 4, Issue : 1
Publication Date: 01/04/2016
Page(s): 834-839

Article Preview

Download Article