Author : K.Suneel 1
Date of Publication :1st December 2017
Abstract: With the inexorably fast monetary globalization and urbanization, interest for vitality sources has expanded manyfold. The measure of energy utilization information has likewise expanded different circumstances, it exhibiting another test mining these gigantic datasets and interpreting fine-grained utilization information into important bits of knowledge. In this paper, we concentrate on the division of client ways of life in light of vitality utilization information and defining bunches that are material to genuine applications in view of area machine learning. All the more particularly, we endeavor to characterize dissect the power utilization between the numerous classes of the family unit and business clients that creates bunches that are relevant to request reaction applications. This paper applies a k-means bunching calculation on delineating to quantify the likenesses between stack profiles and gathering them together into groups. The vitality utilization information utilized as the contribution for the model is from 5000 family units in Hyderabad for a considerable length of time of January and February of 2017. Results additionally demonstrate that few bunches is suggested for very related load profiles
Reference :
-
- Ekanayake, S. Pallickara and G. Fox (2008), MapReduce for Machine Learning on Multicore, In Proceedings IEEE International Conference on E-Science in 2008
- Ananthi,S., and Lakshmi J V N, An Analysis On Machine Learning Algorithms Implemented On Hadoop MapReduce. In Proceedings of International Conference on Communication, Computing and Information Technology (Chennai, India 2015). ICCCMIT ’14.
- Jefree. Dean, Mapreduce: A flexible data processing tool, In Proceedings of ACM Communications, Volume 53, pp 72-77, 2010.
- Cui, Xiaoli, et al. "Optimized big data K-means clustering using MapReduce." The Journal of Supercomputing 70.3 (2014): 1249-1259.
- Akthar, Nadeem, MohdVasimAhamad, and Shahbaz Khan. "Clustering on Big Data Using HadoopMapReduce." Computational Intelligence and Communication Networks (CICN), 2015 International Conference on. IEEE, 2015.
- Zhao, Weizhong, Huifang Ma, and Qing He. "Parallel k-means clustering based on mapreduce." IEEE International Conference on Cloud Computing. Springer Berlin Heidelberg, 2009.
- Dean, J., Ghemawat, S.: MapReduce: Simplified Data Processing on Large Clusters. Communications of The ACM 51(1), 107–113 (2008)
- Moertini, Veronica S., and LiptiaVenica. "Enhancing parallel k-means using map reduce for discovering knowledge from big data." Cloud Computing and Big Data Analysis (ICCCBDA), 2016 IEEE International Conference on. IEEE, 2016
- 1G. Sathiya and P. Kavitha, An Efficient Enhanced KMeans Approach with Improved Initial Cluster Centers, Middle-East Journal of Scientific Research 20 (4): 485- 491, 2014
- S. Na, G. Yong, and L. Xumin, Research on k-means clustering algorithms, IEEE Computer society, 74, 2010, 63-67
- Kahkashan Kouser, Sunita, A comparative study of K Means Algorithm by Different Distance Measures, International Journal of Innovative Research in Computer and Communication Engineering, Vol. 1, Issue 9, November 2013
- M.A. Dalal, N.D. Harale, and U.L. Kulkarni, An iterative improved k-means clustering, ACEEE International Journal on Network Security, 2(3), 2011, 45-48.