A Survey on Performance Improvement of Data Analysis Using Unsupervised K-Means Clustering
The algorithms clustering implemented on the machines and made intelligent machines are called unsupervised machine learning algorithms. They can perform essential tasks by k-means clustering algorithm based on improved quantum particle swarm optimization algorithm is often more error in data analysis. As more data becomes available, more complex problems can be tackled and solved. The analysis of patient's data is becoming more critical to evaluate the patient's medical condition and prevent and take precautions for the future. With the help of technology and computerized automation of machines, data can be analyzed more efficiently. Managing the massive volume of data has many problems interrelated to data security. Experiments on actual datasets show that our technique will get similar results with standard ways with fewer computation tasks. Process mining and data mining techniques have opened new access for the diagnosis of disease.
Similarly, data mining can provide effective treatment for a disease's triennial prevention; finally, an effective clustering result is obtained. The algorithm is tested with the UCI data set. The results show that the improved algorithm ensures the global convergence of the algorithm and brings more accurate clustering results.
. Jing, Han. "Application of fuzzy data mining algorithm in performance evaluation of human resource." In 2009 International Forum on Computer Science-Technology and Applications, vol. 1, pp. 343-346. IEEE, 2009
. M. Emre Celebi, H. A. Kingravi, P. A. Vela, "A Comparative Study of, Efficient Initialization Methods for the K-Means Clustering Algorithm", Expert Systems with Applications, pp. 200-210, vol.40, 2013.
. Lu, J. F., Tang, J. B., Tang, Z. M., & Yang, J. Y, Hierarchical initialization approach for k-means clustering. Pattern Recognition Letters, 29(6), 787–795, 2008.
. T. Zhang and Y. Bo, ``Density-based multiscale analysis for clustering in strong noise settings with varying densities,'' IEEE Access, vol. 6, pp. 25861_25873, 2018.
. Redmond, S. J., & Heneghan, C., A method for initializing the k-means clustering algorithm using KD-trees, Pattern Recognition Letters, 28(8), 965–973, 2009.
. Bai, Lili, Zerui Song, Haijie Bao, and Jingqing Jiang. "K-means Clustering Based on Improved Quantum Particle Swarm Optimization Algorithm." In 2021 13th International Conference on Advanced Computational Intelligence (ICACI), pp. 140-145. IEEE, 2021.
. Shi, Haobin, and Meng Xu. "A Data Classification Method Using Genetic Algorithm and K-Means Algorithm with Optimizing Initial Cluster Center." 2018 IEEE International Conference on Computer and Communication Engineering Technology (CCET). IEEE, 2018
. Shafeeq, A., Hareesha K., Dynamic Clustering of Data with Modified K-Means Algorithm, International Conference on Information and Computer Networks, vol. 27,2012.
. Kamaljit Kaur, Dr Dalvinder Singh Dhaliwal, Dr Ravinder Kumar Vohra," Statistically Refining the Initial Points for K-Means Clustering Algorithm ", International Journal of Advanced Research in Computer Engineering & Technology (IJARCET) Volume 2, Issue 11, November 2013.
. Junatao Wang, Xiaolong Su, "An Improved K-means Clustering Algorithm, Communication Software and Networks (ICCSN), 2011 IEEE 3rd International Conference on 27 May 2011 (pp. 44-46).
. Canlas, Ruben. D. "Data mining in healthcare: Current applications and issues." School of Information Systems & Management, Carnegie Mellon University, Australia (2009).
. K. A. Abdul Nazeer, M. P. Sebastian, "Improving the Accuracy and Efficiency of the k-means Clustering Algorithm, Proceedings of the World Congress on Engineering 2009 Vol I WCE 2009, July 1 - 3, 2009, London, U.K.
. Güvenir, H., Demirӧz, G., Ilter, N. "Learning differential diagnosis of erythematous-squamous diseases using voting feature intervals". Artificial Intelligence in Medicine, 13(3) 147-165, 1998.
. Marty, Babu, G.P. and MN 1994. Clustering with evolution strategies Pattern Recognition, 27, 2, 321-329.