A Review: Map Reduce Framework for Cloud Computing
Keywords:Data Mining, Cloud, Map Reduce Framework, HDFS (Hadoop Distributed File System), Parallel Programming, Distributed Databases
In this generation of Internet, information and data are growing continuously. Even though various Internet services and applications. The amount of information is increasing rapidly. Hundred billions even trillions of web indexes exist. Such large data brings people a mass of information and more difficulty discovering useful knowledge in these huge amounts of data at the same time. Cloud computing can provide infrastructure for large data. Cloud computing has two significant characteristics of distributed computing i.e. scalability, high availability. The scalability can seamlessly extend to large-scale clusters. Availability says that cloud computing can bear node errors. Node failures will not affect the program to run correctly. Cloud computing with data mining does significant data processing through high-performance machine. Mass data storage and distributed computing provide a new method for mass data mining and become an effective solution to the distributed storage and efficient computing in data mining.
K. Chen and WM. Zheng, â€œCloud computing: System instances andcurrent research,â€ Journal of Software, vol. 20, no. 5, pp. 1337-1348,2009 (In Chinese).
 K. Sharma, G. Shrivastava, and 0V. Kumar, â€œWeb Mining: Today andTomorrow,â€ In Proceedings of the IEEE 3rd International Conference onElectronics Computer Technology, Athens, vol. 1, pp. 399â€“403, April2011.
 â€œPincer-Search Algorithm for Discovering Maximum FrequentSetâ€ â€“ AkashSaxena, NITJ
 â€œPincer-Search: An Efficient Algorithm for Discovering theMaximum Frequent Setâ€ â€“ Dao-I Lin, Zvi M. Kedem, 1999
 â€œStudy of Data Mining algorithm in cloud computing usingMapReduce Frameworkâ€ â€“ Viki Patel, Prof. V. B. Nikam,V.J.T.I, Mumbai, 2013
 H. Cheng, P. Tan, S. Jon , and W. F. Punch, â€œRecommendation viaQuery Centered Random Walk on K-partite Graph,â€ In Proceedings ofthe IEEE International Conference on Data Mining, Omaha, pp. 457â€“462, October 2007.
 A. Javed and A. Khokhar, â€œFrequent pattern mining on message passingmultiprocessor systems,â€ Distributed and Parallel Databases, vol. 16, pp.321-334, 2004.
 C. Giannella, K. Liu, T. Olsen, and H. Kargupta, â€œCommunication efficient construction of decision trees over heterogeneously distributeddata,â€ In Proceedings of the Fourth IEEE International Conference onData Mining, pp. 67-74, 2004.
 R. Chen, S. Krishnamoorthy, â€œA New Algorithm for LearningParameters of a Bayesian Network from Distributed Data,â€ InProceedings of the 2002 IEEE International Conference on Data Mining,Maebashi City, pp. 585â€“588, 2002.
 E. Lozano, E. Acuna, â€œParallel Algorithms for Distance- based andDensity-based Outliers,â€ In Proceedings of The Fifth IEEE InternationalConference on Data Mining, Houston, pp. 27-30, November 2005.
 A Topchy, A K Jain, W F Punch, â€œCombining Multiple WeakClusterings,â€ In Proceedings of the 3rd IEEE International Conferenceon Data Mining, pp. 331-338, 2003.
 G. Chen, X. Wu, X. Zhu, â€œSequential pattern mining in multiplestreams,â€ In Proceedings of the 30th International Conference on Datamining.Houston, pp. 585-588, 2005.
 M. Cheng, â€œWeb data mining Based on cloud computing,â€ ComputerScience, vol. 38, no. 10A, pp. 146-149, 2011 (In Chinese).
 WZ. Zhao, HF. Ma, YL, â€œFu. Research on Parallel k-means AlgorithmDesign Based on Hadoop Platform,â€ Computer Science, vol. 38, no.10pp. 166-168, 2011 (In Chinese).
View Full Article:
How to Cite
LicenseAuthors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under aÂ Creative Commons Attribution Licensethat allows others to share the work with an acknowledgement of the work''s authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal''s published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (SeeÂ The Effect of Open Access).