A Review on Unstructured Data using k-Mean Algorithm

Authors

  • Akhilesh Sharma M. Tech. Scholar Department of Computer Science and Engineering Oriental Group of Institutes Bhopal, India

DOI:

https://doi.org/10.24113/ijoscience.v6i6.290

Abstract

Unstructured data are the data without identifiable structure, audio, video and images are few examples. Clustering one of the best techniques in the knowledge extraction process. It is nothing but a grouping of similar data to form a cluster. The distance between the data in one cluster and the other should not be less. Many algorithms are practiced for clustering, in that k-mean clustering is one of the popular terms for cluster analysis. The main aim of the algorithm is to partition the dataset into k clusters based on some computational value. The limitation of k-mean clustering is that it can be applied to either structured or unstructured, not in combination with both. This paper overcomes that limitation by proposing a new k –mean algorithm for extracting hidden knowledge by forming clusters from the combination of unstructured datasets.

Downloads

Download data is not yet available.

Metrics

Metrics Loading ...

References

[1] Daqing Chen, Sai Laing Sain, Kun Guo,” Data mining for the online retail industry: A case study of RFM model-based customer segmentation using data mining”, Springer, Vol. 19, Issue 3, pp 197–208, Sep 2012
[2] Takanobu Nakahara, Takeaki Uno, Yukinobu Hamuro,” Prediction model using micro-clustering”, 18th International Conference on Knowledge-Based and Intelligent Information & Engineering Systems - KES2014, Elsevier, ScienceDirect, vol. 35, pp. 1488 – 1494, 2014.
[3] V. Duon, M. Phayung. ”Fast K-Means Clustering for very large datasets based on Map Reduce Combined with New Cutting Method (FMR KMeans)”, Springer International Publishing Switzerland, 2015.
[4] M. Li and al. “An improved k-means algorithm based on Map reduce and Grid”, International Journal of Grid Distribution Computing, (2015)
[5] Omar Kettani, Faical Ramdani, Benaissa Tadili, ”AKmeans: An Automatic Clustering Algorithm based on Kmeans “, Journal of Advanced Computer Science & Technology, vol. 4, issue 2 2015.
[6] Sk Ahammad Fahad “A Modified K-Means Algorithm for Big Data Clustering” April 2016.?
[7] "IBM What is big data? — bringing big data to the enterprise". www.ibm.com. Retrieved 2013- 08-26.
[8] Francis, Matthew (2012-04-02). "Future telescope array drives development of exabyte processing". Retrieved 2012-10-24.
[9] Vladimír Holý, Ond?ej Sokol, Michal ?erný,”Clustering Retail Products Based on Customer Behaviour”, Applied Soft Computing, Elsevier Vol 60, PP: 752-762, 2017.
[10] Zhexue Huang,CSIRO Mathematical and Information sciences ,Australia ”clustering Large datasets with mixed Numeric And Categorical Values” * This Work was supported by the Cooperative Research Centre for Advanced Computational Systems (ACSys) established under the Australian Government’s Cooperative Research Centres Program.

Downloads

Published

2020-06-03

How to Cite

Sharma, A. (2020). A Review on Unstructured Data using k-Mean Algorithm. SMART MOVES JOURNAL IJOSCIENCE, 6(6), 11-14. https://doi.org/10.24113/ijoscience.v6i6.290