Open AccessAn Efficient Parallel and Distributed Algorithm on Top of MapReduce
Author(s) -
G. Karuna,
I. Rama Krishna,
G. Venkata Rami Reddy
Publication year - 2019
Publication title -
international journal of innovative technology and exploring engineering
Language(s) - English
Resource type - Journals
ISSN - 2278-3075
DOI - 10.35940/ijitee.j9075.0881019
Subject(s) - subspace topology , linear subspace , exploit , computer science , parallelism (grammar) , adaptability , parallel computing , algorithm , theoretical computer science , artificial intelligence , mathematics , computer security , ecology , geometry , biology
The undertaking of subspace bunching is for discover concealed groups present in various subspaces inside of dataset. Lately, through the accumulate development of information extent as well as information measurements, conventional subspace grouping calculations convert wasteful just as ineffectual whereas extricating learning in the huge information condition, bringing about a rising need to structure productive parallel circulated subspace bunching calculations to deal with huge multi- dimensional information by an adequate calculus expense. This article provides MapReduce-dependent calculation of a parallel mafia subspace bunching. The calculation exploits MapReduce's information apportioning in addition undertaking parallelism and accomplishes decent tradeoff amongst the expense for plate gets to besides correspondence fare. The exploratory results indicate near immediate accelerations and demonstrate the elevated adaptability and incredible opportunities for implementation of the suggested calculation.