{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,21]],"date-time":"2025-04-21T08:23:57Z","timestamp":1745223837306,"version":"3.37.3"},"reference-count":13,"publisher":"Wiley","license":[{"start":{"date-parts":[[2021,2,18]],"date-time":"2021-02-18T00:00:00Z","timestamp":1613606400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004539","name":"Kasetsart University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004539","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Applied Computational Intelligence and Soft Computing"],"published-print":{"date-parts":[[2021,2,18]]},"abstract":"<jats:p>Grading is the process of interpreting learning competence to inform learners and instructors of the current learning ability levels and necessary improvement. For norm-referenced grading, the instructors use a conventionally statistical method, z score. It is difficult for such a method to achieve explainable grade discrimination to resolve dispute between learners and instructors. To solve such difficulty, this paper proposes a simple and efficient algorithm for explainable norm-referenced grading. Moreover, the rise of artificial intelligence nowadays makes machine learning techniques attractive to the norm-referenced grading in general. This paper also investigates two popular clustering methods, K-means and partitioning around medoids. The experiment relied on the data sets of various score distributions and a metric, namely, Davies\u2013Bouldin index. The comparative evaluation reveals that our algorithm overall outperforms the other three methods and is appropriate for all kinds of data sets in almost all cases. Our findings however lead to a practically useful guideline for the selection of appropriate grading methods including both clustering methods and z score.<\/jats:p>","DOI":"10.1155\/2021\/8899649","type":"journal-article","created":{"date-parts":[[2021,2,21]],"date-time":"2021-02-21T01:07:36Z","timestamp":1613869656000},"page":"1-14","source":"Crossref","is-referenced-by-count":1,"title":["On Characterization of Norm-Referenced Achievement Grading Schemes toward Explainability and Selectability"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5418-7876","authenticated-orcid":true,"given":"Thepparit","family":"Banditwattanawong","sequence":"first","affiliation":[{"name":"Department of Computer Science, Faculty of Science, Kasetsart University, Bangkok 10900, Thailand"}]},{"given":"Masawee","family":"Masdisornchote","sequence":"additional","affiliation":[{"name":"School of Information Technology, Sripatum University, Bangkok 10900, Thailand"}]}],"member":"311","reference":[{"volume-title":"Handbook of Measurement and Testing","year":"2008","author":"S. Wadhwa","key":"1"},{"key":"2","first-page":"553","article-title":"Evaluating student\u2019s performance using k-means clustering","volume":"4","author":"R. K. Arora","year":"2013","journal-title":"International Journal of Computer Science And Technology"},{"key":"3","first-page":"114","article-title":"Evaluating student\u2019s performance using K-means clustering","volume":"6","author":"S. P. Borgavakar","year":"2017","journal-title":"International Journal of Engineering Research & Technology"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.24032\/ijeacs\/0204\/03"},{"author":"S. Shankar","key":"5","article-title":"Performance analysis of student learning metric using K-mean clustering approach"},{"author":"S. Xi","key":"6","article-title":"A new student achievement evaluation method based on k-means clustering algorithm"},{"article-title":"Early student grade prediction: an empirical study","author":"Z. Iqbal","key":"7","doi-asserted-by":"crossref","DOI":"10.23919\/ICACS.2019.8689136"},{"author":"K. Ramen","key":"8","article-title":"Methods for ordinal peer grading"},{"author":"S. M. Bai","key":"9","article-title":"Automatically constructing grade membership functions for students\u2019 evaluation for fuzzy grading systems"},{"article-title":"Norm-referenced achievement grading: methods and comparison","author":"T. Banditwattanawong","key":"10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-030-58669-0_14"},{"volume-title":"Data Mining: Practical Machine Learning Tools and Techniques","year":"2016","author":"I. H. Witten","key":"11"},{"volume-title":"Data Analysis Based on the L1-Norm and Related Methods","year":"1987","author":"L. Kaufmann","key":"12"},{"volume-title":"Clustering Indices","year":"2017","author":"B. Desgraupes","key":"13"}],"container-title":["Applied Computational Intelligence and Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/acisc\/2021\/8899649.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/acisc\/2021\/8899649.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/acisc\/2021\/8899649.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,21]],"date-time":"2021-02-21T01:07:41Z","timestamp":1613869661000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/acisc\/2021\/8899649\/"}},"subtitle":[],"editor":[{"given":"Christian","family":"Dawson","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2021,2,18]]},"references-count":13,"alternative-id":["8899649","8899649"],"URL":"https:\/\/doi.org\/10.1155\/2021\/8899649","relation":{},"ISSN":["1687-9732","1687-9724"],"issn-type":[{"type":"electronic","value":"1687-9732"},{"type":"print","value":"1687-9724"}],"subject":[],"published":{"date-parts":[[2021,2,18]]}}}