Analysis of K-Means and K-Medoids Algorithms for Grouping Academic Values of Prospective New Students in Selection of Campus Scholarship Recipients

University of Mahkota Tricom Unggul is one of the private universities (PTS) that prepares various scholarships every year, one of which is the Foundation scholarship. However, so far the University in selecting prospective new students who are eligible to receive Foundation scholarships still uses a conventional model, so it is less effective, efficient, and less professional. As a result, it is less objective in selecting prospective new students in scholarship acceptance. Therefore, an algorithm is needed to group data that is eligible to receive Foundation scholarships using an algorithm. The algorithms used to solve the existing problem are the K-means and Kmedoids algorithms, then analyzed which one is effective in solving the problem. Where both can group data well, but the K-medoids algorithm is more effective in solving than K- Means.

Authors

Institutions

Publication Details

Journal
Formosa Journal of Science and Technology
Published
2025-09-30
DOI
https://doi.org/10.55927/fjst.v4i9.224
Primary Topic
Data Mining and Machine Learning Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Analysis of K-Means and K-Medoids Algorithms for Grouping Academic Values of Prospective New Students in Selection of Campus Scholarship Recipients

Preddy Marpaung
Formosa Journal of Science and Technology
Data Mining and Machine Learning Applications
article

Analysis of K-Means and K-Medoids Algorithms for Grouping Academic Values of Prospective New Students in Selection of Campus Scholarship Recipients

Preddy Marpaung
article en

Abstract

University of Mahkota Tricom Unggul is one of the private universities (PTS) that prepares various scholarships every year, one of which is the Foundation scholarship. However, so far the University in selecting prospective new students who are eligible to receive Foundation scholarships still uses a conventional model, so it is less effective, efficient, and less professional. As a result, it is less objective in selecting prospective new students in scholarship acceptance. Therefore, an algorithm is needed to group data that is eligible to receive Foundation scholarships using an algorithm. The algorithms used to solve the existing problem are the K-means and Kmedoids algorithms, then analyzed which one is effective in solving the problem. Where both can group data well, but the K-medoids algorithm is more effective in solving than K- Means.

Formosa Journal of Science and TechnologyVol. 4(9)
Mahidol University (TH)
Openalex Percentile: Top 58%
Data Mining and Machine Learning Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.