مروری نظام‌مند بر پژوهش‌های بهبود الگوریتم کا-میانه برای خوشه‌بندی داده‌ها

نویسندگان

1 دانشگاه قم؛ قم، ایران؛

2 گروه علم اطلاعات و دانش‌شناسی؛ دانشگاه قم؛ قم، ایران؛

چکیده

خوشه‌بندی به‌عنوان یک فرایند جهت شناخت ماهیت و ساختار داده‌ها در بسیاری از حوزه‌های علوم و فناوری‌های مرتبط با آن نقش مهمی در سازماندهی داده‌ها دارد. یکی از الگوریتم‌های پرکاربرد و ساده خوشه‌بندی، کا-میانه است. پژوهش حاضر با هدف مرور نظام‌مند تحقیقات در زمینه بهبود الگوریتم کا-میانه برای خوشه‌بندی داده‌ها صورت گرفته است. این پژوهش با یک راهبرد جدید بر مبنای کاستی‌های الگوریتم کا-میانه به بررسی تحقیقات انجام‌شده در این زمینه و نقش آن در سازماندهی داده‌ها در محدوده سال‌های ۲۰۱۰ تا ۲۰۲۰ می‌پردازد. برای این منظور میزان توجه پژوهشگران به رفع هر یک از کاستی‌های این الگوریتم برای بهبود طی سال‌های مزبور در قالب پرسش‌های پژوهش تدوین شده است. در این پژوهش با استفاده از استراتژی‌ جست‌وجو، پالایش، و استخراج مقاله‌ها در نهایت، ۴۷ منبع مرتبط شناسایی و مورد بررسی قرار گرفت. یافته‌ها نشان داد که بیشترین تحقیقات صورت‌گرفته با غلبه بر کاستی حساس به مراکز خوشه اولیه در جهت بهبود الگوریتم کا-میانه انجام شده است. همچنین، از ۴۷ تحقیق مورد بررسی، الگوریتم بهبودیافته کا-میانه در ۳۵ تحقیق بر روی داده‌های غیرمتنی و در ۱۲ تحقیق بر روی داده‌های متنی اعمال شده است. سرانجام، نتیجه حاصل از بررسی ۶ تحقیق از تحقیقات صورت‌گرفته نشان داد که حجم داده‌ها رابطه‌ای مستقیم با عملکرد الگوریتم بهبودیافته کا-میانه دارد. به‌عبارت دیگر، این الگوریتم باید به‌نوعی اصلاح شود که با اعمال بر روی حجم متفاوت داده‌ها خوشه‌بندی کارآمد و دقیقی انجام دهد.

کلیدواژه‌ها


عنوان مقاله [English]

A Systematic review of K-means Algorithm Improvement Research for Data Clustering

نویسندگان [English]

  • Elham Yalveh 1
  • Yaghoub Norouzi 2
چکیده [English]

Clustering as a process to understand the nature and structure of data plays an important role in organizing data in many areas of science and technology. One of the most widely used and simple algorithms for clustering is K-means. The present study was conducted to systematically reviewing research on improving K-means algorithm on data clustering. This research examines the researches conducted in this field and its role in organizing data in the range of 2010 to 2020 with a new strategy based on the shortcomings of the K-means algorithm. For this purpose, the amount of attention of researchers to eliminate any of the shortcomings of this algorithm in order to improve it in recent years has been compiled in the form of research questions. In this study, with the use of a search strategy for refining and extracting articles, 47 related sources were identified and examined. Findings showed that most researches have been done by overcoming the sensitive shortcomings to initial cluster centers to improve the K-means algorithm. Also, out of a total of 47 studies, the improved K-means algorithm has been applied in 35 studies on non-textual data and in 12 studies on textual data. Finally, the results of a review of six studies showed that the amount of data is directly related to the performance of improved K-means algorithm. In other words, this algorithm must be modified in such a way as to perform efficient and accurate clustering by applying it to different amounts of data.

کلیدواژه‌ها [English]

  • Data Clustering
  • k-Means Algorithm
  • Clustering Improvement
  • Systematic review
  1. Afzali, M., & S. Kumar. 2019. Text Document Clustering: Issues and Challenges. Paper presented at the 2019 International Conference on Machine Learning, Big Data, Cloud and Parallel Computing (COMITCon) [DOI:10.1109/COMITCon.2019.8862247]
  2. Afzali, M., & S. Kumar. 2019. Text Document Clustering: Issues and Challenges. Paper presented at the 2019 International Conference on Machine Learning, Big Data, Cloud and Parallel Computing (COMITCon) [DOI:10.1109/COMITCon.2019.8862247]
  3. Aggarwal, C. C. 2004. A human-computer interactive method for projected clustering. IEEE transactions on knowledge and data engineering 16 (4): 448-460. [DOI:10.1109/TKDE.2004.1269669]
  4. Aggarwal, C. C. 2004. A human-computer interactive method for projected clustering. IEEE transactions on knowledge and data engineering 16 (4): 448-460. [DOI:10.1109/TKDE.2004.1269669]
  5. Awawdeh, S., A. Edinat, & A. Sleit. 2019. An Enhanced K-means Clustering Algorithm for Multi-attributes Data. International Journal of Computer Science and Information Security (IJCSIS) 17 (2): 1-6.
  6. Awawdeh, S., A. Edinat, & A. Sleit. 2019. An Enhanced K-means Clustering Algorithm for Multi-attributes Data. International Journal of Computer Science and Information Security (IJCSIS) 17 (2): 1-6.
  7. Bansal, A., M. Sharma, & S. Goel. 2017. Improved k-mean clustering algorithm for prediction analysis using classification technique in data mining. International Journal of Computer Applications 157 (6): 0975-8887. [DOI:10.5120/ijca2017912719]
  8. Bansal, A., M. Sharma, & S. Goel. 2017. Improved k-mean clustering algorithm for prediction analysis using classification technique in data mining. International Journal of Computer Applications 157 (6): 0975-8887. [DOI:10.5120/ijca2017912719]
  9. Benabdellah, A. C., A. Benghabrit, & I. Bouhaddou. 2019. A survey of clustering algorithms for an industrial context. Procedia Computer Science 148: 291-302. [DOI:10.1016/j.procs.2019.01.022]
  10. Benabdellah, A. C., A. Benghabrit, & I. Bouhaddou. 2019. A survey of clustering algorithms for an industrial context. Procedia Computer Science 148: 291-302. [DOI:10.1016/j.procs.2019.01.022]
  11. Bide, P., & R. Shedge. 2015. Improved Document Clustering using k-means algorithm. Paper presented at the 2015 IEEE International Conference on Electrical, Computer and Communication Technologies (ICECCT). Coimbatore, India. [DOI:10.1109/ICECCT.2015.7226065]
  12. Bide, P., & R. Shedge. 2015. Improved Document Clustering using k-means algorithm. Paper presented at the 2015 IEEE International Conference on Electrical, Computer and Communication Technologies (ICECCT). Coimbatore, India. [DOI:10.1109/ICECCT.2015.7226065]
  13. Chadha, A., & S. Kumar. 2014. An improved K-means clustering algorithm: a step forward for removal of dependency on K. Paper presented at the 2014 International Conference on Reliability Optimization and Information Technology (ICROIT). Faridabad, India. [DOI:10.1109/ICROIT.2014.6798312]
  14. Chadha, A., & S. Kumar. 2014. An improved K-means clustering algorithm: a step forward for removal of dependency on K. Paper presented at the 2014 International Conference on Reliability Optimization and Information Technology (ICROIT). Faridabad, India. [DOI:10.1109/ICROIT.2014.6798312]
  15. Chaturvedi, E. N., & E. A. Rajavat. 2013. An improvement in K-mean clustering algorithm using better time and accuracy. International Journal of Programming Languages and Applications 3 (4): 13-19. [DOI:10.5121/ijpla.2013.3402]
  16. Chaturvedi, E. N., & E. A. Rajavat. 2013. An improvement in K-mean clustering algorithm using better time and accuracy. International Journal of Programming Languages and Applications 3 (4): 13-19. [DOI:10.5121/ijpla.2013.3402]
  17. Choudhary, A., P. Sharma, & M. Singh. 2016. Improving K-means through better initialization and normalization. Paper presented at the 2016 International Conference on Advances in Computing, Communications and Informatics (ICACCI). Jaipur, India. [DOI:10.1109/ICACCI.2016.7732418]
  18. Choudhary, A., P. Sharma, & M. Singh. 2016. Improving K-means through better initialization and normalization. Paper presented at the 2016 International Conference on Advances in Computing, Communications and Informatics (ICACCI). Jaipur, India. [DOI:10.1109/ICACCI.2016.7732418]
  19. Fink, A. 2013. Conducting research literature reviews: from the internet to paper. SAGE Publications.
  20. Fink, A. 2013. Conducting research literature reviews: from the internet to paper. SAGE Publications.
  21. Fränti, P., & S. Sieranoja. 2019. How much can k-means be improved by using better initialization and repeats? Pattern Recognition 93: 95-112. [DOI:10.1016/j.patcog.2019.04.014]
  22. Fränti, P., & S. Sieranoja. 2019. How much can k-means be improved by using better initialization and repeats? Pattern Recognition 93: 95-112. [DOI:10.1016/j.patcog.2019.04.014]
  23. Goswami, J. 2015. A Comparative Study on Clustering and Classification Algorithms. International Journal of Scientific Engineering and Applied Science (IJSEAS) 1 (3): 2395-3470.
  24. Goswami, J. 2015. A Comparative Study on Clustering and Classification Algorithms. International Journal of Scientific Engineering and Applied Science (IJSEAS) 1 (3): 2395-3470.
  25. Goyal, M., & S. Kumar. 2014. Improving the initial centroids of K-means clustering algorithm to generalize its applicability. Journal of the Institution of Engineers (India): Series B, 95 (4): 345-350. [DOI:10.1007/s40031-014-0106-z]
  26. Goyal, M., & S. Kumar. 2014. Improving the initial centroids of K-means clustering algorithm to generalize its applicability. Journal of the Institution of Engineers (India): Series B, 95 (4): 345-350. [DOI:10.1007/s40031-014-0106-z]
  27. Han, J., M. Kamber, & J. Pei. 2012. Data mining: concepts and techniques. Waltham, MA: Morgan Kaufman Publishers, 10, 978-971.
  28. Han, J., M. Kamber, & J. Pei. 2012. Data mining: concepts and techniques. Waltham, MA: Morgan Kaufman Publishers, 10, 978-971.
  29. Haraty, R. A., M. Dimishkieh, & M. Masud. 2015. An enhanced k-means clustering algorithm for pattern discovery in healthcare data. International Journal of distributed sensor networks 11 (6): 615740. [DOI:10.1155/2015/615740]
  30. Haraty, R. A., M. Dimishkieh, & M. Masud. 2015. An enhanced k-means clustering algorithm for pattern discovery in healthcare data. International Journal of distributed sensor networks 11 (6): 615740. [DOI:10.1155/2015/615740]
  31. Hotho, A., A. Nürnberger, & G. Paaß. 2005. A brief survey of text mining. Paper presented at the Ldv Forum.
  32. Hotho, A., A. Nürnberger, & G. Paaß. 2005. A brief survey of text mining. Paper presented at the Ldv Forum.
  33. Iezzi, D. F. 2012. A new method for adapting the k-means algorithm to text mining. Italian Journal of Applied Statistics 22 (1): 69-80.
  34. Iezzi, D. F. 2012. A new method for adapting the k-means algorithm to text mining. Italian Journal of Applied Statistics 22 (1): 69-80.
  35. Jaganathan, P., & S. Jaiganesh. 2013. An improved K-means algorithm combined with particle swarm optimization approach for efficient web document clustering. Paper presented at the 2013 International Conference on Green Computing, Communication and Conservation of Energy (ICGCE). Chennai, India. [DOI:10.1109/ICGCE.2013.6823538]
  36. Jaganathan, P., & S. Jaiganesh. 2013. An improved K-means algorithm combined with particle swarm optimization approach for efficient web document clustering. Paper presented at the 2013 International Conference on Green Computing, Communication and Conservation of Energy (ICGCE). Chennai, India. [DOI:10.1109/ICGCE.2013.6823538]
  37. Kant, S., & I. A. Ansari. 2016. An improved K means clustering with Atkinson index to classify liver patient dataset. International Journal of System Assurance Engineering and Management 7 (1): 222-228. [DOI:10.1007/s13198-015-0365-3]
  38. Kant, S., & I. A. Ansari. 2016. An improved K means clustering with Atkinson index to classify liver patient dataset. International Journal of System Assurance Engineering and Management 7 (1): 222-228. [DOI:10.1007/s13198-015-0365-3]
  39. Karegowda, A. G., T. Vidya, M. Jayaram, & A. Manjunath. 2013. Improving performance of k-means clustering by initializing cluster centers using genetic algorithm and entropy based fuzzy clustering for categorization of diabetic patients. Paper presented at the Proceedings of International Conference on Advances in Computing. New Delhi, India. [DOI:10.1007/978-81-322-0740-5_108]
  40. Karegowda, A. G., T. Vidya, M. Jayaram, & A. Manjunath. 2013. Improving performance of k-means clustering by initializing cluster centers using genetic algorithm and entropy based fuzzy clustering for categorization of diabetic patients. Paper presented at the Proceedings of International Conference on Advances in Computing. New Delhi, India. [DOI:10.1007/978-81-322-0740-5_108]
  41. Kaur, N., J. K. Sahiwal, & N. Kaur. 2012. Efficient k-means clustering algorithm using ranking method in data mining. International Journal of Advanced Research in Computer Engineering & Technology 1 (3): 85-91.
  42. Kaur, N., J. K. Sahiwal, & N. Kaur. 2012. Efficient k-means clustering algorithm using ranking method in data mining. International Journal of Advanced Research in Computer Engineering & Technology 1 (3): 85-91.
  43. Khandare, A., & A. Alvi. 2016. Survey of Improved k-means Clustering Algorithms: Improvements, Shortcomings and Scope for Further Enhancement and Scalability. In Information Systems Design and Intelligent Applications (pp. 495-503) New Delhi, India: Springer. [DOI:10.1007/978-81-322-2752-6_48]
  44. Khandare, A., & A. Alvi. 2016. Survey of Improved k-means Clustering Algorithms: Improvements, Shortcomings and Scope for Further Enhancement and Scalability. In Information Systems Design and Intelligent Applications (pp. 495-503) New Delhi, India: Springer. [DOI:10.1007/978-81-322-2752-6_48]
  45. Khatri, S. & K. Garg. 2016. Document Clustering Using Improved K-Means Algorithm. International Journal of Engineering Research and General Science 4 (3): 787-793.
  46. Khatri, S. & K. Garg. 2016. Document Clustering Using Improved K-Means Algorithm. International Journal of Engineering Research and General Science 4 (3): 787-793.
  47. Kim, H., H. K. Kim, & S. Cho. 2020. Improving spherical k-means for document clustering: Fast initialization, sparse centroid projection, and efficient cluster labeling. Expert Systems with Applications, 150, 113288. [DOI:10.1016/j.eswa.2020.113288]
  48. Kim, H., H. K. Kim, & S. Cho. 2020. Improving spherical k-means for document clustering: Fast initialization, sparse centroid projection, and efficient cluster labeling. Expert Systems with Applications, 150, 113288. [DOI:10.1016/j.eswa.2020.113288]
  49. Larose, D. T., & C. D. Larose. 2014. Discovering knowledge in data: an introduction to data mining (Vol. 4). Canada: John Wiley & Sons. [DOI:10.1002/9781118874059]
  50. Larose, D. T., & C. D. Larose. 2014. Discovering knowledge in data: an introduction to data mining (Vol. 4). Canada: John Wiley & Sons. [DOI:10.1002/9781118874059]
  51. Linyao, X., & W. Jianguo. 2018. Improved K-means Algorithm Based on optimizing Initial Cluster Centers and Its Application. Paper presented at the 2018 Second International Conference of Sensor Network and Computer Engineering (ICSNCE 2018). Xi'an, China. [DOI:10.2991/icsnce-18.2018.2]
  52. Linyao, X., & W. Jianguo. 2018. Improved K-means Algorithm Based on optimizing Initial Cluster Centers and Its Application. Paper presented at the 2018 Second International Conference of Sensor Network and Computer Engineering (ICSNCE 2018). Xi'an, China. [DOI:10.2991/icsnce-18.2018.2]
  53. Liu, G., S. Huang, C. Lu, & Y. Du. 2014. An improved k-means algorithm based on association rules. International Journal of Computer Theory and Engineering 6 (2): 146. [DOI:10.7763/IJCTE.2014.V6.853]
  54. Liu, G., S. Huang, C. Lu, & Y. Du. 2014. An improved k-means algorithm based on association rules. International Journal of Computer Theory and Engineering 6 (2): 146. [DOI:10.7763/IJCTE.2014.V6.853]
  55. Liu, Z., J. Bao, & F. Ding. 2018. An Improved K-Means Clustering Algorithm Based on Semantic Model. Paper presented at the Proceedings of the International Conference on Information Technology and Electrical Engineering 2018. Xiamen Fujian, China. [DOI:10.1145/3148453.3306269]
  56. Liu, Z., J. Bao, & F. Ding. 2018. An Improved K-Means Clustering Algorithm Based on Semantic Model. Paper presented at the Proceedings of the International Conference on Information Technology and Electrical Engineering 2018. Xiamen Fujian, China. [DOI:10.1145/3148453.3306269]
  57. Ma, J. 2014. Improved K-Means Algorithm in Text Semantic Clustering. The Open Cybernetics & Systemics Journal 8 (1): 530-534. [DOI:10.2174/1874110X01408010530]
  58. Ma, J. 2014. Improved K-Means Algorithm in Text Semantic Clustering. The Open Cybernetics & Systemics Journal 8 (1): 530-534. [DOI:10.2174/1874110X01408010530]
  59. Mann, A. K., & Kaur, N. (2013). Review paper on clustering techniques. Global Journal of Computer Science and Technology.
  60. Mann, A. K., & Kaur, N. (2013). Review paper on clustering techniques. Global Journal of Computer Science and Technology.
  61. Masud, M. A., M. M. Rahman, S. Bhadra, & S. Saha. 2019. Improved k-means Algorithm using Density Estimation. Paper presented at the 2019 International Conference on Sustainable Technologies for Industry 4.0 (STI). India. [DOI:10.1109/STI47673.2019.9068033]
  62. Masud, M. A., M. M. Rahman, S. Bhadra, & S. Saha. 2019. Improved k-means Algorithm using Density Estimation. Paper presented at the 2019 International Conference on Sustainable Technologies for Industry 4.0 (STI). India. [DOI:10.1109/STI47673.2019.9068033]
  63. Na, S., L. Xumin, & G. Yong. (2010. Research on k-means clustering algorithm: An improved k-means clustering algorithm. Paper presented at the 2010 Third International Symposium on intelligent information technology and security informatics. Jian, China. [DOI:10.1109/IITSI.2010.74]
  64. Na, S., L. Xumin, & G. Yong. (2010. Research on k-means clustering algorithm: An improved k-means clustering algorithm. Paper presented at the 2010 Third International Symposium on intelligent information technology and security informatics. Jian, China. [DOI:10.1109/IITSI.2010.74]
  65. Napoleon, D., & P. G. Lakshmi. 2010. An enhanced k-means algorithm to improve the efficiency using normal distribution data points. International Journal on Computer Science and Engineering 2 (7): 2409-2413.
  66. Napoleon, D., & P. G. Lakshmi. 2010. An enhanced k-means algorithm to improve the efficiency using normal distribution data points. International Journal on Computer Science and Engineering 2 (7): 2409-2413.
  67. Okoli, C., & K. Schabram. 2010. A guide to conducting a systematic literature review of information systems research. [DOI:10.2139/ssrn.1954824]
  68. Okoli, C., & K. Schabram. 2010. A guide to conducting a systematic literature review of information systems research. [DOI:10.2139/ssrn.1954824]
  69. Prabhu, P., & N. Anbazhagan. 2011. Improving the performance of k-means clustering for high dimensional data set. International Journal on Computer Science and Engineering 3 (6): 2317-2322.
  70. Prabhu, P., & N. Anbazhagan. 2011. Improving the performance of k-means clustering for high dimensional data set. International Journal on Computer Science and Engineering 3 (6): 2317-2322.
  71. Rajeswari, K., O. Acharya, M. Sharma, M. Kopnar, & K. Karandikar. 2015. Improvement in K-means clustering algorithm using data clustering. Paper presented at the 2015 International Conference on Computing Communication Control and Automation. Pune, India. [DOI:10.1109/ICCUBEA.2015.205]
  72. Rajeswari, K., O. Acharya, M. Sharma, M. Kopnar, & K. Karandikar. 2015. Improvement in K-means clustering algorithm using data clustering. Paper presented at the 2015 International Conference on Computing Communication Control and Automation. Pune, India. [DOI:10.1109/ICCUBEA.2015.205]
  73. Rathore, P., & D. Shukla. 2015. Analysis and performance improvement of K-means clustering in big data environment. Paper presented at the 2015 International Conference on Communication Networks (ICCN). [DOI:10.1109/ICCN.2015.9]
  74. Rathore, P., & D. Shukla. 2015. Analysis and performance improvement of K-means clustering in big data environment. Paper presented at the 2015 International Conference on Communication Networks (ICCN). [DOI:10.1109/ICCN.2015.9]
  75. Raval Unnati, R., & Chaita, J. (2016). Implementing & Improvisation of K-means Clustering Algorithm. International Journal of Computer Science and Mobile Computing 5: 191-203.
  76. Raval Unnati, R., & Chaita, J. (2016). Implementing & Improvisation of K-means Clustering Algorithm. International Journal of Computer Science and Mobile Computing 5: 191-203.
  77. Saklecha, A., & J. Raikwal. 2017. Enhanced K-Means Clustering Algorithm Using Collaborative Filtering Approach. Oriental Journal of Computer Science & Technology.10 (2): 474-479. [DOI:10.13005/ojcst/10.02.31]
  78. Saklecha, A., & J. Raikwal. 2017. Enhanced K-Means Clustering Algorithm Using Collaborative Filtering Approach. Oriental Journal of Computer Science & Technology.10 (2): 474-479. [DOI:10.13005/ojcst/10.02.31]
  79. Shunye, W. 2013. An improved k-means clustering algorithm based on dissimilarity. Paper presented at the Proceedings 2013 International Conference on Mechatronic Sciences, Electric Engineering and Computer (MEC). Shenyang, China.
  80. Shunye, W. 2013. An improved k-means clustering algorithm based on dissimilarity. Paper presented at the Proceedings 2013 International Conference on Mechatronic Sciences, Electric Engineering and Computer (MEC). Shenyang, China.
  81. Strech, D., & N. Sofaer. 2012. How to write a systematic review of reasons. Journal of Medical Ethics 38 (2): 121-126. [DOI:10.1136/medethics-2011-100096]
  82. Strech, D., & N. Sofaer. 2012. How to write a systematic review of reasons. Journal of Medical Ethics 38 (2): 121-126. [DOI:10.1136/medethics-2011-100096]
  83. Taihao, L., N. Tuya, Z. Jianshe, R. Fuji, & L. Shupeng. 2020. An Improved K-Means Algorithm Based on Initial Clustering Center Optimization. ZTE Communications 15 (S2): 43-46.
  84. Taihao, L., N. Tuya, Z. Jianshe, R. Fuji, & L. Shupeng. 2020. An Improved K-Means Algorithm Based on Initial Clustering Center Optimization. ZTE Communications 15 (S2): 43-46.
  85. Tajunisha, N., & V. Saravanan. 2011. An efficient method to improve the clustering performance for high dimensional data by principal component analysis and modified K-means. Intl Journal of Database Mgt System 3: 196-205.
  86. Tajunisha, N., & V. Saravanan. 2011. An efficient method to improve the clustering performance for high dimensional data by principal component analysis and modified K-means. Intl Journal of Database Mgt System 3: 196-205.
  87. Thilagaraj, T., & N. Sengottaiyan. 2019. Implementation of an Improved K-Means Clustering Algorithm for Balanced Clusters. Pramana Research Journal 9 (6): 352-360.
  88. Thilagaraj, T., & N. Sengottaiyan. 2019. Implementation of an Improved K-Means Clustering Algorithm for Balanced Clusters. Pramana Research Journal 9 (6): 352-360.
  89. Tunali, V., T. Bilgin, & A. Camurcu. 2016. An Improved Clustering Algorithm for Text Mining: Multi-Cluster Spherical K-Means. International Arab Journal of Information Technology (IAJIT) 13 (1): 12-19.
  90. Tunali, V., T. Bilgin, & A. Camurcu. 2016. An Improved Clustering Algorithm for Text Mining: Multi-Cluster Spherical K-Means. International Arab Journal of Information Technology (IAJIT) 13 (1): 12-19.
  91. Vashist, A., & R. Nath. 2016. Document Clustering using Improved K-means Algorithm. International Journal of Research in Social Sciences 6 (9): 193-204.
  92. Vashist, A., & R. Nath. 2016. Document Clustering using Improved K-means Algorithm. International Journal of Research in Social Sciences 6 (9): 193-204.
  93. Wang, J., & X. Su. 2011. An improved K-Means clustering algorithm. Paper presented at the 2011 IEEE 3rd International Conference on Communication Software and Networks. Xi'an, China. [DOI:10.1109/ICCSN.2011.6014384]
  94. Wang, J., & X. Su. 2011. An improved K-Means clustering algorithm. Paper presented at the 2011 IEEE 3rd International Conference on Communication Software and Networks. Xi'an, China. [DOI:10.1109/ICCSN.2011.6014384]
  95. Wu, G., H. Lin, E. Fu, & L. Wang. 2015. An improved k-means algorithm for document clustering. Paper presented at the 2015 international conference on computer science and mechanical automation (CSMA). Hangzhou, China. [DOI:10.1109/CSMA.2015.20]
  96. Wu, G., H. Lin, E. Fu, & L. Wang. 2015. An improved k-means algorithm for document clustering. Paper presented at the 2015 international conference on computer science and mechanical automation (CSMA). Hangzhou, China. [DOI:10.1109/CSMA.2015.20]
  97. Xie, H., L. Zhang, C. P. Lim, Y. Yu, C. Liu, H. Liu, & J. Walters. 2019. Improving K-means clustering with enhanced firefly algorithms. Applied Soft Computing, 84: 105763. [DOI:10.1016/j.asoc.2019.105763]
  98. Xie, H., L. Zhang, C. P. Lim, Y. Yu, C. Liu, H. Liu, & J. Walters. 2019. Improving K-means clustering with enhanced firefly algorithms. Applied Soft Computing, 84: 105763. [DOI:10.1016/j.asoc.2019.105763]
  99. Xinwu, L. 2012. A new text clustering algorithm based on improved K-means. Journal of Software 7 (1): 95-101. [DOI:10.4304/jsw.7.1.95-101]
  100. Xinwu, L. 2012. A new text clustering algorithm based on improved K-means. Journal of Software 7 (1): 95-101. [DOI:10.4304/jsw.7.1.95-101]
  101. Xiong, C., Z. Hua, K. Lv, & X. Li. 2016. An Improved K-means text clustering algorithm By Optimizing initial cluster centers. Paper presented at the 2016 7th International Conference on Cloud Computing and Big Data (CCBD). Macau, China. [DOI:10.1109/CCBD.2016.059]
  102. Xiong, C., Z. Hua, K. Lv, & X. Li. 2016. An Improved K-means text clustering algorithm By Optimizing initial cluster centers. Paper presented at the 2016 7th International Conference on Cloud Computing and Big Data (CCBD). Macau, China. [DOI:10.1109/CCBD.2016.059]
  103. Yadav, A., & S. Dhingra. 2016. An Enhanced K-Means Clustering Algorithm to Remove Empty Clusters. International Journal of Engineering Development and Research (IJEDR) 4 (4): 901-907.
  104. Yadav, A., & S. Dhingra. 2016. An Enhanced K-Means Clustering Algorithm to Remove Empty Clusters. International Journal of Engineering Development and Research (IJEDR) 4 (4): 901-907.
  105. _____, A., & S. K. Singh. 2016. An Improved K-Means Clustering Algorithm. International Journal of Computing 5 (2): 88-103.
  106. _____, A., & S. K. Singh. 2016. An Improved K-Means Clustering Algorithm. International Journal of Computing 5 (2): 88-103.
  107. Yedla, M., S. R. Pathakota, & T. Srinivasa. 2010. Enhancing K-means clustering algorithm with improved initial center. International Journal of computer science and information technologies 1 (2): 121-125.
  108. Yedla, M., S. R. Pathakota, & T. Srinivasa. 2010. Enhancing K-means clustering algorithm with improved initial center. International Journal of computer science and information technologies 1 (2): 121-125.
  109. Yu, S.-S., S.-W. Chu, C.-M. Wang, Y.-K. Chan, & T.-C. Chang. 2018. Two improved k-means algorithms. Applied Soft Computing 68: 747-755. [DOI:10.1016/j.asoc.2017.08.032]
  110. Yu, S.-S., S.-W. Chu, C.-M. Wang, Y.-K. Chan, & T.-C. Chang. 2018. Two improved k-means algorithms. Applied Soft Computing 68: 747-755. [DOI:10.1016/j.asoc.2017.08.032]
  111. Zhang, G., C. Zhang, & H. Zhang. 2018. Improved K-means algorithm based on density Canopy. Knowledge-based systems 145: 289-297. [DOI:10.1016/j.knosys.2018.01.031]
  112. Zhang, G., C. Zhang, & H. Zhang. 2018. Improved K-means algorithm based on density Canopy. Knowledge-based systems 145: 289-297. [DOI:10.1016/j.knosys.2018.01.031]
  113. Zhang, Y., K. Wang, H. Lu, H. Guo, & L. Xu. 2013. An improved k-means clustering algorithm over data accumulation in Delay Tolerant Mobile Sensor Network. Paper presented at the 2013 8th International Conference on Communications and Networking in China (CHINACOM). Guilin, China.
  114. Zhang, Y., K. Wang, H. Lu, H. Guo, & L. Xu. 2013. An improved k-means clustering algorithm over data accumulation in Delay Tolerant Mobile Sensor Network. Paper presented at the 2013 8th International Conference on Communications and Networking in China (CHINACOM). Guilin, China.
  115. Zheng, L. 2020. Improved K-Means Clustering Algorithm Based on Dynamic Clustering. International Journal of Advanced Research in Big Data Management System 4: 17-26. [DOI:10.21742/IJARBMS.2020.4.1.02]
  116. Zheng, L. 2020. Improved K-Means Clustering Algorithm Based on Dynamic Clustering. International Journal of Advanced Research in Big Data Management System 4: 17-26. [DOI:10.21742/IJARBMS.2020.4.1.02]
  117. Zhu, J., & H. Wang. 2010. An improved K-means clustering algorithm. Paper presented at the 2010 2nd IEEE International Conference on Information Management and Engineering. Chengdu, China. [DOI:10.1109/ICIME.2010.5478087]
  118. Zhu, J., & H. Wang. 2010. An improved K-means clustering algorithm. Paper presented at the 2010 2nd IEEE International Conference on Information Management and Engineering. Chengdu, China. [DOI:10.1109/ICIME.2010.5478087]