{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T13:40:29Z","timestamp":1782999629134,"version":"3.54.5"},"reference-count":51,"publisher":"Wiley","license":[{"start":{"date-parts":[[2021,5,17]],"date-time":"2021-05-17T00:00:00Z","timestamp":1621209600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Heilongjiang Intellectual Property Office"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Scientific Programming"],"published-print":{"date-parts":[[2021,5,17]]},"abstract":"<jats:p>Context. Educational Data Mining (EDM) is a new and emerging research area. Data mining techniques are used in the educational field in order to extract useful information on employee or student progress behaviors. Recent increase in the availability of learning data has given importance and momentum to educational data mining to better understand and optimize the learning process and the environments in which it takes place. Objective. Data are the most valuable commodity for any organization. It is very difficult to extract useful information from such a large and massive collection of data. Data mining techniques are used to forecast and evaluate academic performance of students based on their academic record and participation in the forum. Although several studies have been carried out to evaluate the academic performance of students worldwide, there is a lack of appropriate studies to assess factors that can boost the academic performance of students. Methodology. The current study sought to weigh up factors that contribute to improving student academic performance in Pakistan. In this paper, both the simple and parallel clustering techniques are implemented and analyzed to point out their best features. The Parallel K-Mean algorithms overcome the problems of simple algorithm and the outcomes of the parallel algorithms are always the same, which improves the cluster quality, number of iterations, and elapsed time. Results. Both the algorithms are tested and compared with each other for a dataset of 10,000 and 5000 integer data items. The datasets are evaluated 10 times for minimum elapse time-varying K value from 1 to 10. The proposed study is more useful for scientific research data sorting. Scientific research data statistics are more accurate.<\/jats:p>","DOI":"10.1155\/2021\/9988318","type":"journal-article","created":{"date-parts":[[2021,5,18]],"date-time":"2021-05-18T00:05:09Z","timestamp":1621296309000},"page":"1-20","source":"Crossref","is-referenced-by-count":18,"title":["Analysis of Simple K-Mean and Parallel K-Mean Clustering for Software Products and Organizational Performance Using Education Sector Dataset"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7119-0361","authenticated-orcid":true,"given":"Rui","family":"Shang","sequence":"first","affiliation":[{"name":"Office of Science and Technology Administration, Heilongjiang Bayi Agricultural University, DaQing 163000, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Balqees","family":"Ara","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Peshawar, Peshawar, Pakistan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Islam","family":"Zada","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Peshawar, Peshawar, Pakistan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0126-9944","authenticated-orcid":true,"given":"Shah","family":"Nazir","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Swabi, Swabi, Pakistan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zaid","family":"Ullah","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Bacha Khan University, Charsadda, Pakistan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shafi Ullah","family":"Khan","sequence":"additional","affiliation":[{"name":"Institute of Computing, Kohat University of Science & Technology, Kohat, Pakistan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"311","reference":[{"issue":"1","key":"1","article-title":"MemepiC: towards a unified in-memory big data management system","volume":"26","author":"Q. Cai","year":"2018","journal-title":"IEEE Transactions on Big Data"},{"key":"2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-49340-4_4","article-title":"Big data analysis on clouds","volume-title":"Handbook of Big Data Technologies","author":"L. Belcastro","year":"2017"},{"key":"3","article-title":"Database systems: design, implementation, & management: nelson education","author":"C. Coronel","year":"2016"},{"key":"4","article-title":"Data warehouse and business intelligence: comparative analysis of olap tools","author":"M. K. Bhetwal","year":"2011"},{"key":"5","first-page":"1","article-title":"PNrule: a new framework for learning classifier models in data mining (a case-study in network intrusion detection)","author":"R. Agarwal"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/lgrs.2014.2360833"},{"key":"7","article-title":"Efficient clustering of web documents using hybrid approach in data mining","author":"P. S. Gamare","year":"2015"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2017.02.008"},{"key":"9","first-page":"524","article-title":"Application of clustering techniques to mixture density modelling for continuous-speech recognition","author":"C. Dugast"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/lgrs.2009.2034033"},{"key":"11","first-page":"49","article-title":"Color recognition of clothes based on K-means and mean shift","author":"X. Zheng"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2018.11.010"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1021\/acs.nanolett.8b01526"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ygeno.2017.06.009"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-017-2182-8"},{"key":"16","first-page":"1","article-title":"K-means clustering using Max-min distance measure","author":"N. K. Visalakshi"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-13-1813-9_28"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/access.2019.2945911"},{"key":"19","first-page":"88","article-title":"An improved K-means clustering algorithm","volume":"5","author":"A. Yadav","year":"2016","journal-title":"International Journal of Computing"},{"key":"20","first-page":"2076","article-title":"K-means clustering algorithm based on coefficient of variation","author":"S. Ren"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1145\/2990507"},{"key":"22","first-page":"61","article-title":"A pillar algorithm for K-means optimization by distance maximization for initial centroid designation","author":"A. R. Barakbah"},{"key":"23","first-page":"649","article-title":"A graph-based approach to named entity categorization in Wikipedia using conditional random fields","author":"Y. Watanabe"},{"key":"24","first-page":"309","article-title":"Comparative analysis of K-means with other clustering algorithms to improve search result","author":"S. Mehrotra"},{"key":"25","first-page":"3","article-title":"Data clustering: 50 years beyond K-means","author":"A. K. Jain"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-017-5587-8"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1016\/j.cmpb.2016.04.005"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.03.062"},{"key":"29","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1016\/j.ins.2014.01.015","article-title":"Data-intensive applications, challenges, techniques and technologies: a survey on Big Data","volume":"275","author":"C. P. Chen","year":"2014","journal-title":"Information Sciences"},{"key":"30","first-page":"734","article-title":"An improved clustering method based on K-means","author":"Y. Lin"},{"issue":"5","key":"31","article-title":"Visualising pipeline sensor datasets with modified incremental orthogonal centroid algorithm","volume":"8","author":"O. A. Folorunso","year":"2011","journal-title":"International Journal of Computer Science Issues"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1016\/j.rser.2017.09.108"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1177\/0165551516638784"},{"key":"34","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1109\/LGRS.2009.2034033","article-title":"Application of a multiseed-based clustering technique for automatic satellite image segmentation","volume":"7","author":"S. Saha","year":"2009","journal-title":"IEEE Geoscience and Remote Sensing Letters"},{"key":"35","first-page":"121","article-title":"Clustering the mixed numerical and categorical dataset using similarity weight and filter method","volume":"5","author":"M. J. Reddy","year":"2012","journal-title":"International Journal of Database Theory and Application"},{"key":"36","first-page":"524","article-title":"Application of clustering techniques to mixture density modelling for continuous-speech recognition","author":"C. Dugast"},{"key":"37","article-title":"Refinement OF clusters from K-means with ant colony optimization","volume":"6","author":"C. Mary","year":"2009","journal-title":"Journal of Theoretical & Applied Information Technology"},{"key":"38","first-page":"1","article-title":"A wordsets based document clustering algorithm for large datasets","author":"A. Sharma"},{"key":"39","article-title":"An efficient K-Means clustering algorithm for massive data","author":"M. Cap\u00f3","year":"2018"},{"key":"40","first-page":"717","article-title":"Data clustering with modified K-means algorithm","author":"R. V. Singh"},{"key":"41","first-page":"44","article-title":"An improved K-Means clustering algorithm","author":"J. Wang"},{"issue":"6","key":"42","doi-asserted-by":"crossref","first-page":"5868","DOI":"10.1109\/WCICA.2006.1714203","article-title":"The study of parallel K-means algorithm","volume":"26","author":"Y. Zhang","year":"2006","journal-title":"The 6th World Congress on Intelligent Control and Automation"},{"key":"43","doi-asserted-by":"publisher","DOI":"10.5815\/ijisa.2013.02.05"},{"key":"44","article-title":"Parallel and distributed image segmentation based on colors using K-means clustering algorithm","author":"A. E. Top"},{"key":"45","first-page":"710","article-title":"Parallel K-means algorithm on agricultural databases","volume":"10","author":"V. Ramesh","year":"2013","journal-title":"International Journal of Computer Science Issues (IJCSI)"},{"key":"46","first-page":"354","article-title":"A K-medoids based clustering scheme with an application to document clustering","author":"A. Onan"},{"key":"47","doi-asserted-by":"crossref","DOI":"10.1145\/3433210.3453104","article-title":"Privacy-preserving density-based clustering","author":"B. Bozdemir","year":"2021"},{"key":"48","first-page":"764","article-title":"An improved parallel K-means clustering algorithm with MapReduce","author":"Q. Liao"},{"key":"49","article-title":"A novel adaptive density-based spatial clustering of application with noise based on bird swarm optimization algorithm","volume":"6","author":"L. Wang","year":"2021","journal-title":"Computer Communications"},{"key":"50","first-page":"138","article-title":"On the two-level hybrid clustering algorithm","author":"E. Y. Cheu"},{"key":"51","first-page":"1847","article-title":"A review on K-means data clustering approach","volume":"4","author":"S. Shukla","year":"2014","journal-title":"International Journal of Information and Computation Technology"}],"container-title":["Scientific Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/sp\/2021\/9988318.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/sp\/2021\/9988318.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/sp\/2021\/9988318.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,27]],"date-time":"2022-12-27T17:33:16Z","timestamp":1672162396000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/sp\/2021\/9988318\/"}},"subtitle":[],"editor":[{"given":"Zhongguo","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"editor"}]}],"short-title":[],"issued":{"date-parts":[[2021,5,17]]},"references-count":51,"alternative-id":["9988318","9988318"],"URL":"https:\/\/doi.org\/10.1155\/2021\/9988318","relation":{},"ISSN":["1875-919X","1058-9244"],"issn-type":[{"value":"1875-919X","type":"electronic"},{"value":"1058-9244","type":"print"}],"subject":[],"published":{"date-parts":[[2021,5,17]]}}}