{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T03:03:21Z","timestamp":1784257401366,"version":"3.55.0"},"reference-count":36,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T00:00:00Z","timestamp":1658275200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Key Research and Development Plan of China","award":["2019YFB1406303"],"award-info":[{"award-number":["2019YFB1406303"]}]},{"name":"National Key Research and Development Plan of China","award":["61370137"],"award-info":[{"award-number":["61370137"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Fundation of China","doi-asserted-by":"publisher","award":["2019YFB1406303"],"award-info":[{"award-number":["2019YFB1406303"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Fundation of China","doi-asserted-by":"publisher","award":["61370137"],"award-info":[{"award-number":["61370137"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>With the globalization of higher education, academic evaluation is increasingly valued by the scientific and educational circles. Although the number of published papers of academic evaluation methods is increasing, previous research mainly focused on the method of assigning different weights for various indicators, which can be subjective and limited. This paper investigates the evaluation of academic performance by using the statistical K-means (SKM) algorithm to produce clusters. The core idea is mapping the evaluation data from Euclidean space to Riemannian space in which the geometric structure can be used to obtain accurate clustering results. The method can adapt to different indicators and make full use of big data. By using the K-means algorithm based on statistical manifolds, the academic evaluation results of universities can be obtained. Furthermore, through simulation experiments on the top 20 universities of China with the traditional K-means, GMM and SKM algorithms, respectively, we analyze the advantages and disadvantages of different methods. We also test the three algorithms on a UCI ML dataset. The simulation results show the advantages of the SKM algorithm.<\/jats:p>","DOI":"10.3390\/e24071004","type":"journal-article","created":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T11:22:24Z","timestamp":1658316144000},"page":"1004","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Application of Statistical K-Means Algorithm for University Academic Evaluation"],"prefix":"10.3390","volume":"24","author":[{"given":"Daohua","family":"Yu","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Beijing Institute of Technology, Beijing 100081, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xin","family":"Zhou","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Beijing Institute of Technology, Beijing 100081, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yu","family":"Pan","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Beijing Institute of Technology, Beijing 100081, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhendong","family":"Niu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Beijing Institute of Technology, Beijing 100081, China"},{"name":"School of Computing and Information, University of Pittsburgh, Pittsburgh, PA 15260, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Huafei","family":"Sun","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Beijing Institute of Technology, Beijing 100081, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2022,7,20]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2015.04.002","article-title":"A Review of Theory and Practice in Scientometrics","volume":"246","author":"Mingers","year":"2015","journal-title":"Eur. J. Oper. Res."},{"key":"ref_2","first-page":"156","article-title":"Research on the Evaluating Index System of University Knowledge Creation Capability","volume":"31","author":"Xia","year":"2010","journal-title":"Sci. Sci. Technol. Manag."},{"key":"ref_3","first-page":"604","article-title":"Empirical Study on the Network Indexes of Topping University in China","volume":"26","author":"Zhang","year":"2008","journal-title":"Inf. Sci."},{"key":"ref_4","first-page":"111","article-title":"Research on University Innovation Indicators with the Factor Analysis","volume":"28","author":"Liu","year":"2007","journal-title":"Sci. Sci. Technol. Manag."},{"key":"ref_5","first-page":"48","article-title":"Construction of Performance Evaluation System for Sci-Tech Achievements Transformation in High-level Engineering Colleges Based on PCA and Comprehensive Index Method","volume":"39","author":"Chen","year":"2019","journal-title":"Sci. Technol. Manag. Res."},{"key":"ref_6","first-page":"47","article-title":"Research on Evaluation of Scientific and Technological Innovation Ability of Universities Based on Entropy Weight-DEMATEL in Jiangsu","volume":"38","author":"Zhang","year":"2018","journal-title":"Sci. Technol. Manag. Res."},{"key":"ref_7","first-page":"773","article-title":"Study on Evaluation Index System of Transformation of Scientific and Technological Achievements in CAS","volume":"13","author":"Li","year":"2017","journal-title":"Sci. Technol. Dev."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Faraki, M., Harandi, M.T., and Porikli, F. (2015, January 7\u201312). More about VLAD: A leap from Euclidean to Riemannian manifolds. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Boston, MA, USA.","DOI":"10.1109\/CVPR.2015.7299129"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/j.patrec.2016.10.012","article-title":"Gait based recognition via fusing information from Euclidean and Riemannian manifolds","volume":"84","author":"Kastaniotis","year":"2016","journal-title":"Pattern Recognit. Lett."},{"key":"ref_10","first-page":"7","article-title":"Effect of Distance Functions on Simple K-means Clustering Algorithm","volume":"49","author":"Loohach","year":"2012","journal-title":"Int. J. Comput. Appl."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1109\/JSTSP.2013.2260320","article-title":"Riemannian Distances for Signal Classification by Power Spectral Density","volume":"7","author":"Li","year":"2013","journal-title":"IEEE J. Sel. Top. Signal Process."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Zhang, S., Cao, Y., Li, W., Yan, F., Luo, Y., and Sun, H. (2019, January 11\u201313). A New Riemannian Structure in SPD(n). Proceedings of the 2019 IEEE International Conference on Signal, Information and Data Processing (ICSIDP), Chongqing, China.","DOI":"10.1109\/ICSIDP47821.2019.9173017"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s41884-018-0014-4","article-title":"Wasserstein Riemannian Geometry of Gaussian densities","volume":"1","author":"Malag","year":"2018","journal-title":"Inf. Geom."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Do Carmo, M.P. (1992). Riemannian Geometry, Springer.","DOI":"10.1007\/978-1-4757-2201-7"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Amari, S.I. (2016). Information Geometry and Its Applications, Springer.","DOI":"10.1007\/978-4-431-55978-8"},{"key":"ref_16","first-page":"226","article-title":"A Clustering Algorithm Based on Statistical Manifold","volume":"41","author":"Sun","year":"2021","journal-title":"Trans. Beijing Inst. Technol."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"1406","DOI":"10.1109\/TKDE.2010.259","article-title":"Laplacian Regularized Gaussian Mixture Model for Data Clustering","volume":"23","author":"He","year":"2011","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1016\/j.patcog.2016.07.007","article-title":"Density-Ratio Based Clustering for Discovering Clusters with Varying Densities","volume":"60","author":"Zhu","year":"2016","journal-title":"Pattern Recognit."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"1492","DOI":"10.1126\/science.1242072","article-title":"Clustering by Fast Search and Find of Density Peaks","volume":"344","author":"Rodriguez","year":"2014","journal-title":"Science"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Aryal, A.M., and Wang, S. (2017, January 2\u20134). Discovery of Patterns in Spatio-Temporal Data Using Clustering Techniques. Proceedings of the 2017 2nd International Conference on Image, Vision and Computing (ICIVC), Chengdu, China.","DOI":"10.1109\/ICIVC.2017.7984703"},{"key":"ref_21","unstructured":"Aggarwal, C.C., and Reddy, C.K. (2014). Data Clustering: Algorithms and Applications, Hall\/CRC."},{"key":"ref_22","unstructured":"Clarivate Analytics (2021, November 01). Web of Science. Available online: http:\/\/www.webofscience.com\/."},{"key":"ref_23","unstructured":"Nanjing University (2021, November 05). Chinese Social Sciences Citation Index. Available online: http:\/\/cssci.nju.edu.cn\/."},{"key":"ref_24","unstructured":"Tongfang Co., Ltd. (2021, November 03). China National Knowledge Infrastructure. Available online: https:\/\/www.cnki.net\/."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Singh, A.K., Mittal, S., Malhotra, P., and Srivastava, Y.V. (2020, January 11\u201313). Clustering Evaluation by Davies-Bouldin Index(DBI) in Cereal data using K-Means. Proceedings of the 2020 Fourth International Conference on Computing Methodologies and Communication (ICCMC), Erode, India.","DOI":"10.1109\/ICCMC48092.2020.ICCMC-00057"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Gupta, T., and Panda, S.P. (2019, January 14\u201316). Clustering Validation of CLARA and K-Means Using Silhouette & DUNN Measures on Iris Dataset. Proceedings of the 2019 International Conference on Machine Learning, Big Data, Cloud and Parallel Computing (COMITCon), Faridabad, India.","DOI":"10.1109\/COMITCon.2019.8862199"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1016\/j.patrec.2009.09.011","article-title":"Data clustering: 50 years beyond K-means","volume":"31","author":"Jain","year":"2010","journal-title":"Pattern Recognit. Lett."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"1293","DOI":"10.1016\/j.patrec.2004.04.007","article-title":"Cluster center initialization algorithm for K-means clustering","volume":"25","author":"Khan","year":"2004","journal-title":"Pattern Recognit. Lett."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Ye, Y., Huang, J.Z., Chen, X., Zhou, S., Williams, G., and Xu, X. (2006). Neighborhood Density Method for Selecting Initial Cluster Centers in K-Means Clustering. Advances in Knowledge Discovery and Data Mining, Springer.","DOI":"10.1007\/11731139_23"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1111\/1467-9868.00293","article-title":"Estimating the Number of Clusters in a Data Set via the Gap Statistic","volume":"63","author":"Tibshirani","year":"2001","journal-title":"J. R. Stat. Soc. Ser. B (Stat. Methodol.)"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Tzortzis, G., and Likas, A. (2008, January 1\u20138). The global kernel k-means clustering algorithm. Proceedings of the 2008 IEEE International Joint Conference on Neural Networks, Hong Kong, China.","DOI":"10.1109\/IJCNN.2008.4634069"},{"key":"ref_32","unstructured":"Zhang, R., and Rudnicky, A.I. (2002, January 11\u201315). A large scale clustering scheme for kernel K-Means. Proceedings of the 2002 International Conference on Pattern Recognition, Quebec City, QC, Canada."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"35689","DOI":"10.1007\/s11042-019-08007-z","article-title":"A generic codebook based approach for gait recognition","volume":"78","author":"Khan","year":"2019","journal-title":"Multimed. Tools Appl."},{"key":"ref_34","first-page":"78","article-title":"Information and the Accuracy Attainable in the Estimation of Statistical Parameters","volume":"20","author":"Rao","year":"1945","journal-title":"Reson. J. Sci. Educ."},{"key":"ref_35","unstructured":"Dua, D., and Graff, C. (2019). UCI Machine Learning Repository, University of California, School of Information and Computer Science. Available online: http:\/\/archive.ics.uci.edu\/ml."},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Buscema, M., Terzi, S., and Tastle, W. (2010, January 12\u201314). A new meta-classifier. Proceedings of the Annual Meeting of the North American Fuzzy Information Processing Society, Toronto, ON, Canada.","DOI":"10.1109\/NAFIPS.2010.5548298"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/7\/1004\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T23:54:36Z","timestamp":1760140476000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/7\/1004"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,20]]},"references-count":36,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2022,7]]}},"alternative-id":["e24071004"],"URL":"https:\/\/doi.org\/10.3390\/e24071004","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,20]]}}}