Melola Discovery

← Melola Discovery

Journal SINTA 1

Classification and Prediction of Students' GPA Using K-Means Clustering Algorithm to Assist Student Admission Process

Journal of Information Systems Engineering and Business Intelligence · Vol. 7 No. 1 (2021) · pp. 1–10

DOI
10.20473/jisebi.7.1.1-10
ISSN
2443-2555, 2598-6333
Published
2021-04-27
Publisher
Universitas Airlangga
Language
eng

Abstract

Background: Student admission at universities aims to select the best candidates who will excel and finish their studies on time. There are many factors to be considered in student admission. To assist the process, an intelligent model is needed to spot the potentially high achieving students, as well as to identify potentially struggling students as early as possible.Objective: This research uses K-means clustering to predict students' grade point average (GPA) based on students' profile, such as high school status and location, university entrance test score and English language competence.Methods: Students' data from class of 2008 to 2017 are used to create two clusters using K-means clustering algorithm. Two centroids from the clusters are used to classify all the data into two groups: high GPA and low GPA. We use the data from class of 2018 as test data. The performance of the prediction is measured using accuracy, precision and recall.Results: Based on the analysis, the K-means clustering method is 78.59% accurate among the merit-based-admission students and 94.627% among the regular-admission students.Conclusion: The prediction involving merit-based-admission students has lower predictive accuracy values than that of involving regular-admission students because the clustering model for the merit-based-admission data is K = 3, but for the prediction, the assumption is K = 2.

Collaboration network of the authors

3 authors · 3 co-authorship links

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Duta Wacana Christian University
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

Metadata source: OAI-PMH (metadata jurnal) https://e-journal.unair.ac.id/JISEBI/oai, first harvested 29 Oct 2026, last seen 8 Nov 2026.
Original metadata (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Classification and Prediction of Students' GPA Using  K-Means Clustering Algorithm to Assist Student Admission Process</dc:title>
	<dc:creator>Santosa, Raden Gunawan</dc:creator>
	<dc:creator>Lukito, Yuan</dc:creator>
	<dc:creator>Chrismanto, Antonius Rachmat</dc:creator>
	<dc:description xml:lang="en-US">Background: Student admission at universities aims to select the best candidates who will excel and finish their studies on time. There are many factors to be considered in student admission. To assist the process, an intelligent model is needed to spot the potentially high achieving students, as well as to identify potentially struggling students as early as possible.Objective: This research uses K-means clustering to predict students' grade point average (GPA) based on students' profile, such as high school status and location, university entrance test score and English language competence.Methods: Students' data from class of 2008 to 2017 are used to create two clusters using K-means clustering algorithm. Two centroids from the clusters are used to classify all the data into two groups:  high GPA and low GPA. We use the data from class of 2018 as test data.  The performance of the prediction is measured using accuracy, precision and recall.Results: Based on the analysis, the K-means clustering method is 78.59% accurate among the merit-based-admission students and 94.627% among the regular-admission students.Conclusion: The prediction involving merit-based-admission students has lower predictive accuracy values than that of involving regular-admission students because the clustering model for the merit-based-admission data is K = 3, but for the prediction, the assumption is K = 2. </dc:description>
	<dc:publisher xml:lang="en-US">Universitas Airlangga</dc:publisher>
	<dc:date>2021-04-27</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://e-journal.unair.ac.id/JISEBI/article/view/22395</dc:identifier>
	<dc:identifier>10.20473/jisebi.7.1.1-10</dc:identifier>
	<dc:source xml:lang="en-US">Journal of Information Systems Engineering and Business Intelligence; Vol. 7 No. 1 (2021): April; 1-10</dc:source>
	<dc:source>2443-2555</dc:source>
	<dc:source>2598-6333</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://e-journal.unair.ac.id/JISEBI/article/view/22395/13988</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2021 The Authors. Published by Universitas Airlangga.</dc:rights>
</oai_dc:dc>