74
Views
3
CrossRef citations to date
0
Altmetric
Articles

Performance evaluation of K-means clustering on Hadoop infrastructure

&

References

  • Anchalia, P.P., Koundinya, A.K. and Srinath, N.K., 2013, June. Ma- preduce design of k-means clustering algorithm. In 2013 International Conference on Information Science and Applications (ICISA) (pp. 1-5). IEEE.
  • Bayardo, R.J., Ma, Y. and Srikant, R., 2007, May. Scaling up all pair’s similarity search. In Proceedings of the 16th international conference on World Wide Web (pp. 131-140). ACM.
  • Cui, X., Zhu, P., Yang, X., Li, K. and Ji, C., 2014. Optimized big data K-means clustering using MapReduce. The Journal of Supercomputing, 70(3), pp.1249-1259. doi: 10.1007/s11227-014-1225-7
  • Dean, J. and Ghemawat, S., 2008. MapReduce: simplified data pro- cessing on large clusters. Communications of the ACM, 51(1), pp.107- 113. doi: 10.1145/1327452.1327492
  • Ekanayake, J., Pallickara, S. and Fox, G., 2008, December. Mapreduce for data intensive scientific analyses. In 2008 IEEE Fourth International Conference on eScience (pp. 277-284). IEEE.
  • Fischer, M.J., 2008, August. Evolution of distributed computing the- ory: from concurrency to networks and beyond. In Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing (pp. 460-460). ACM. doi: 10.1145/1400751.1400858
  • Gong, J., 2018. Association feature mining algorithm of web access- ing data in big data environment. Journal of Discrete Mathematical Sci- ences and Cryptography, 21(2), pp.333-337. doi: 10.1080/09720529.2018.1449308
  • Jiang, D., Tung, A.K. and Chen, G., 2010. Map-join-reduce: Toward scalable and efficient data analysis on large clusters. IEEE transactions on knowledge and data engineering, 23(9), pp.1299-1311. doi: 10.1109/TKDE.2010.248
  • Kerdprasop, K. and Kerdprasop, N., 2010, October. Parallelization of k-means clustering on multi-core processors. In Proceedings of the 10th WSEAS international conference on Applied computer science (Vol. 10, pp. 472-477). World Scientific and Engineering Academy and Society (WSEAS).
  • Kumar, A., Kiran, M. and Prathap, B.R., 2013, July. Verification and validation of mapreduce program model for parallel k-means algorithm on hadoop cluster. In 2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT) (pp. 1-8). IEEE.
  • Liao, K., Liu, G., Xiao, L. and Liu, C., 2013. A sample-based hierar- chical adaptive K-means clustering method for large-scale video re- trieval. Knowledge-Based Systems, 49, pp.123-133. doi: 10.1016/j.knosys.2013.05.003
  • Li, H.G., Wu, G.Q., Hu, X.G., Zhang, J., Li, L. and Wu, X., 2011, January. K-means clustering with bagging and mapreduce. In 2011 44th Hawaii International Conference on System Sciences (pp. 1-8). IEEE.
  • Peter, S.J., 2011. Minimum spanning tree-based clustering for outlier detection. Journal of Discrete Mathematical Sciences and Cryptography, 14(2), pp.149-166. doi: 10.1080/09720529.2011.10698329
  • Wang, C.Y., Zhao, W., Liu, Q. and Chen, H.W., 2017. Optimization of the tool selection based on big data. Journal of Discrete Mathematical Sciences and Cryptography, 20(1), pp.341-360. doi: 10.1080/09720529.2016.1183310
  • Zhao, W., Ma, H. and He, Q., 2009, December. Parallel k-means clus- tering based on mapreduce. In IEEE International Conference on Cloud Computing (pp. 674-679). Springer, Berlin, Heidelberg.
  • Zhao, Y., 2018. Manufacturing personalization models based on in- dustrial big data. Journal of Discrete Mathematical Sciences and Cryptography, 21(6), pp.1287-1292. doi: 10.1080/09720529.2018.1526403
  • Khan, Tayyab, Karan Singh, Mohamed Abdel-Basset, Hoang Viet Long, Satya P. Singh, and Manisha Manjul. “A Novel and Compre- hensive Trust Estimation Clustering-Based Approach for Large Scale Wireless Sensor Networks.” IEEE Access, vol. 7, pp. 58221-58240, (2019). doi: 10.1109/ACCESS.2019.2914769
  • Karthikeyan, T., S. John Peter, and S. Chidambaranathan. “Meta clus- ters through minimum spanning tree-based clustering for perfor- mance analysis of students.” Journal of Discrete Mathematical Sciences and Cryptography 14, no. 4 (2011): 349-367. doi: 10.1080/09720529.2011.10698342
  • Peter, S. John. “Local Density-based Hierarchical Clustering using Minimum Spanning Tree.” Journal of Discrete Mathematical Sciences and Cryptography 16, no. 2-3 (2013): 125-137. doi: 10.1080/09720529.2013.778471
  • Peter, S. John. “Minimum spanning tree-based clustering for outlier detection.” Journal of Discrete Mathematical Sciences and Cryptography 14, no. 2 (2011): 149-166. doi: 10.1080/09720529.2011.10698329

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.