Author : G.Akhilesh 1
Date of Publication :20th November 2017
Abstract: Over the most recent couple of decades overseeing huge information has turned out to be testing assignment on account of the expanding volume and many-sided quality of the information being made or gathered. The issue here is the means by which to viably oversee and investigate the information and coming about data. The arrangement requires an extensive approach that contains every one of the phases from the underlying information accumulation to its last analysis..Traditional grouping methods don't address every one of the prerequisites satisfactorily. The new methods need to make utilization of practically equivalent to registering ideas keeping in mind the end goal to have the capacity to scale with rising informational collection sizes. In this paper, we suggest a parallel molecule swarm streamlining bunching (MRCPSO) calculation that depends on MapReduce. The test comes about demonstrates The proposed framework is versatile in preparing extensive information on item equipment. Expanding informational collection sizes and accomplishes a near the direct speedup while keeping up the grouping quality.
Reference :
-
- G. Bell, A. Hey, and A. Szalay, “Beyond the data deluge,”Science 323 AAAS, vol. 39, 2006.
- J. Han, Data Mining: Concepts and Techniques. MorganKaufmann, San Francisco, CA, USA, 2005.
- J. Dean and S. Ghemawat, “Mapreduce: Simplified data processing on large clusters,” 2004, pp. 137–150. [Online].Available:http://www.usenix.org/events/osdi04/t ech/dean.html
- M. Snir, S. Otto, S. Huss-Lederman, D. Walker, and J. Dongarra, MPI: The Complete Reference. MIT Press Cambridge, MA, USA, 1995.
- (2011) Apache software foundation, hadoop mapreduce. [Online]. Available: http://hadoop.apache.org/mapreduce
- (2011) Disco mapreduce framework. [Online]. Available:http://discoproject.org
- (2011) Hadoop - facebook engg, note. [Online]. Available: http://www.facebook.com/note.php?noteid=161 21578919
- (2011) Yahoo inc. hadoop at yahoo! [Online]. Available:http://developer.yahoo.com/Hadoop
- T. Gunarathne, T. Wu, J. Qiu, and G. Fox, “Cloud computing paradigms for pleasingly parallel biomedical applications,” in Proceedings of 19th ACM International Symposium on High Performance Distributed Computing. ACM, January 2010, pp. 460–469.
- S. Krishnan, C. Baru, and C. Crosby, “Evaluation of mapreduce for gridding lidar data,” in Proceedings of the CLOUDCOM ’10. Washington, DC, USA: IEEE Computer Society, 2010, pp. 33–40.
- Z. Weizhong, M. Huifang, and H. Qing, “Parallel kmeans clustering based on mapreduce,” in Proceedings of the CloudCom ’09. Berlin, Heidelberg: SpringerVerlag, 2009, pp. 674–679.
- L. Guang, W. Gong-Qing, H. Xue-Gang, Z. Jing, L. Lian, and W. Xindong, “K-means clustering with bagging and mapreduce,” in Proceedings of the 2011 44th Hawaii International Conference on System Sciences. Washington, DC, USA: IEEE Computer Society, 2011, pp. 1–8.
- S. Papadimitriou and J. Sun, “Disco: Distributed coclustering with map-reduce: A case study towards petabyte-scale end-to-end mining,” in Proc. of the IEEE ICDM ’8, Washington, DC, USA, 2008, pp. 512–521.
- E. Alina, I. Sungjin, and M. Benjamin, “Fast clustering using mapreduce,” in Proceedings of KDD ’11. NY, USA: ACM, 2011, pp. 681–689.
- F. Cordeiro, “Clustering very large multidimensional datasets with mapreduce,” in Proceedings of KDD ’11. NY, USA: ACM, 2011, pp. 690–698.