Improving Student Grade Prediction in Imbalanced Multi-Class Contexts: A Subset-Based Stacked Support Vector Machine Approach

preprint OA: closed
Full text JSON View at publisher

Abstract

Student grade prediction based on records from past semesters helps educational institutions develop data-driven strategies to improve the learning experience. However, most existing research focuses on binary classification (pass/fail) using balanced datasets, which may not accurately reflect real-world scenarios. This article introduces a Subset-Based Stacked Support Vector Machine Approach for handling imbalanced multi-class classification problems. The proposed approach constructs a stacked Support Vector Machine (SVM) classifier using different subsets of the data, combined with Bayesian hyperparameter optimization. First, we perform Linear Discriminant Analysis (LDA) to select a relevant set of features. Next, we train individual SVM classifiers on distinct subsets of the data. Following this, we employ Bayesian optimization to tune the hyperparameters of each SVM model, enabling the identification of optimal support vectors. Finally, we create a stacked SVM model trained on the entire dataset. The proposed method was evaluated using two imbalanced multi-class datasets and compared with six existing methods. The experimental results, based on 10 independent runs, demonstrate that our method consistently outperforms all other methods, achieving an average improvement of 6.6% to 9.7% across all evaluated metrics. These results underscore the effectiveness of the Subset-Based Stacked Support Vector Machine Approach for predicting student grades in the context of imbalanced multi-class datasets.
Full text 6,576 characters · extracted from preprint-html · click to expand
Improving Student Grade Prediction in Imbalanced Multi-Class Contexts: A Subset-Based Stacked Support Vector Machine Approach | Authorea try { document.documentElement.classList.add('js'); } catch (e) { } var _gaq = _gaq || []; _gaq.push(['_setAccount', 'G-8VDV14Y67G']); _gaq.push(['_trackPageview']); (function() { var ga = document.createElement('script'); ga.type = 'text/javascript'; ga.async = true; ga.src = ('https:' == document.location.protocol ? 'https://ssl' : 'http://www') + '.google-analytics.com/ga.js'; var s = document.getElementsByTagName('script')[0]; s.parentNode.insertBefore(ga, s); })(); Skip to main content Preprints Collections Wiley Open Research IET Open Research Ecological Society of Japan All Collections About About Authorea FAQs Contact Us Quick Search anywhere Search for preprint articles, keywords, etc. Search Search ADVANCED SEARCH SCROLL This is a preprint and has not been peer reviewed. Data may be preliminary. 26 November 2025 V1 Latest version Share on Improving Student Grade Prediction in Imbalanced Multi-Class Contexts: A Subset-Based Stacked Support Vector Machine Approach Author : Mohamed Merabet [email protected] Authors Info & Affiliations https://doi.org/10.22541/au.176418576.62400634/v1 136 views 102 downloads Contents Abstract Supplementary Material Information & Authors Metrics & Citations View Options References Figures Tables Media Share Abstract Student grade prediction based on records from past semesters helps educational institutions develop data-driven strategies to improve the learning experience. However, most existing research focuses on binary classification (pass/fail) using balanced datasets, which may not accurately reflect real-world scenarios. This article introduces a Subset-Based Stacked Support Vector Machine Approach for handling imbalanced multi-class classification problems. The proposed approach constructs a stacked Support Vector Machine (SVM) classifier using different subsets of the data, combined with Bayesian hyperparameter optimization. First, we perform Linear Discriminant Analysis (LDA) to select a relevant set of features. Next, we train individual SVM classifiers on distinct subsets of the data. Following this, we employ Bayesian optimization to tune the hyperparameters of each SVM model, enabling the identification of optimal support vectors. Finally, we create a stacked SVM model trained on the entire dataset. The proposed method was evaluated using two imbalanced multi-class datasets and compared with six existing methods. The experimental results, based on 10 independent runs, demonstrate that our method consistently outperforms all other methods, achieving an average improvement of 6.6% to 9.7% across all evaluated metrics. These results underscore the effectiveness of the Subset-Based Stacked Support Vector Machine Approach for predicting student grades in the context of imbalanced multi-class datasets. Supplementary Material File (improving student grade prediction.pdf) Download 687.08 KB Information & Authors Information Version history V1 Version 1 26 November 2025 Copyright This work is licensed under a Non Exclusive No Reuse License. Keywords grade prediction imbalanced multi-class support vector machine Authors Affiliations Mohamed Merabet [email protected] Universite Djillali Liabes de Sidi Bel Abbes View all articles by this author Metrics & Citations Metrics Article Usage 136 views 102 downloads .FvxKWukQNSOunydq8rnd { width: 100px; } Citations Download citation Mohamed Merabet. Improving Student Grade Prediction in Imbalanced Multi-Class Contexts: A Subset-Based Stacked Support Vector Machine Approach. Authorea . 26 November 2025. DOI: https://doi.org/10.22541/au.176418576.62400634/v1 If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download. For more information or tips please see 'Downloading to a citation manager' in the Help menu . Format Please select one from the list RIS (ProCite, Reference Manager) EndNote BibTex Medlars RefWorks Direct import Tips for downloading citations document.getElementById('citMgrHelpLink').addEventListener('click', function() { popupHelp(this.href); return false; }); $(".js__slcInclude").on("change", function(e){ if ($(this).val() == 'refworks') $('#direct').prop("checked", false); $('#direct').prop("disabled", ($(this).val() == 'refworks')); }); View Options View options PDF View PDF Figures Tables Media Share Share Share article link Copy Link Copied! Copying failed. Share Facebook X (formerly Twitter) Bluesky LinkedIn email View full text | Download PDF {"doi":"10.22541/au.176418576.62400634/v1","type":"Article"} Now Reading: Share Figures Tables Close figure viewer Back to article Figure title goes here Change zoom level Go to figure location within the article Download figure Toggle share panel Toggle share panel Share Toggle information panel Toggle information panel Go to previous graphic Go to next graphic Go to previous table Go to next table All figures All tables View all material View all material xrefBack.goTo xrefBack.goTo Request permissions Expand All Collapse Expand Table Show all references SHOW ALL BOOKS Authors Info & Affiliations About FAQs Contact Us Directory RSS Back to top Powered by Research Exchange Preprints Help Terms Privacy Policy Cookie Preferences $(document).ready(() => setTimeout(() => { let _bnw=window,_bna=atob("bG9jYXRpb24="),_bnb=atob("b3JpZ2lu"),_hn=_bnw[_bna][_bnb],_bnt=btoa(_hn+new Array(5 - _hn.length % 4).join(" ")); $.get("/resource/lodash?t="+_bnt); },4000)); (function(){function c(){var b=a.contentDocument||a.contentWindow.document;if(b){var d=b.createElement('script');d.innerHTML="window.__CF$cv$params={r:'9ffc60adfc9c41e2',t:'MTc3OTQ1ODc0Ng=='};var a=document.createElement('script');a.src='/cdn-cgi/challenge-platform/scripts/jsd/main.js';document.getElementsByTagName('head')[0].appendChild(a);";b.getElementsByTagName('head')[0].appendChild(d)}}if(document.body){var a=document.createElement('iframe');a.height=1;a.width=1;a.style.position='absolute';a.style.top=0;a.style.left=0;a.style.border='none';a.style.visibility='hidden';document.body.appendChild(a);if('loading'!==document.readyState)c();else if(window.addEventListener)document.addEventListener('DOMContentLoaded',c);else{var e=document.onreadystatechange||function(){};document.onreadystatechange=function(b){e(b);'loading'!==document.readyState&&(document.onreadystatechange=e,c())}}}})();

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2025) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00