MétaCan
Menu
Back to cohort
Record W4404578764 · doi:10.62951/modem.v2i4.238

Pemodelan K-Nearest Neighbor Untuk Identifikasi Pola Kepuasan Mahasiswa Terhadap Pelayanan Kampus (Studi Kasus : STMIK Kaputama)

2024· article· en· W4404578764 on OpenAlexaff
Muhammad Rizky R Ritonga, Marto Sihombing, Selfira Selfira

Bibliographic record

VenueModem · 2024
Typearticle
Languageen
FieldComputer Science
TopicData Mining and Machine Learning Applications
Canadian institutionsKootenay Association for Science & Technology
Fundersnot available
KeywordsComputer science

Abstract

fetched live from OpenAlex

This research focuses on using the K-Nearest Neighbor (KNN) algorithm to model student satisfaction with campus services. The study finds that the quality of the dataset strongly influences the accuracy of the KNN classification results. Factors such as data cleanliness, balanced class distribution, and sufficient training data volume are highlighted as crucial for a successful model. The research also emphasizes the significance of proper feature selection in enhancing classification performance, suggesting that irrelevant features can introduce noise and decrease model accuracy. The model was evaluated using a dataset of 1032 data points and K=5, achieving an accuracy of 93.72%. While the model performed well for certain classes such as "Very Good" and "None", challenges were encountered in classifying the "Fair" and "Deficient" classes. The study concludes that KNN is effective in identifying student satisfaction patterns but highlights the need for improvements in accurately classifying these challenging classes. Ultimately, the research underscores the importance of data quality and feature selection in enhancing the performance of classification models for student satisfaction analysis.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.003
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.006
Threshold uncertainty score0.014

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.002
Science and technology studies0.0010.000
Scholarly communication0.0020.003
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0040.002

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.012
GPT teacher head0.267
Teacher spread0.255 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2024
Admission routes1
Has abstractyes

Explore more

Same venueModemSame topicData Mining and Machine Learning ApplicationsFrench-language works237,207