Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.13091/1691
Title: | A k-ELM approach to the prediction of number of students taking make-up exams | Authors: | Kıran, Mustafa Servet Sıramkaya, Eyup Esme, Engin |
Keywords: | Extreme Learning Machine Multiple Extreme Learning Machine Artificial Bee Colony Make-Up Exam Extreme Learning-Machine |
Issue Date: | 2022 | Publisher: | Gazi Univ, Fac Engineering Architecture | Abstract: | Purpose: The main objective of this study is to present a novel problem, and novel methodology to solve this problem. The problem is to predict the number of students who fail the course and will join the make-up exams. Theory and Methods: The number of students who fail the course should take a make-up exam, but some of them do not join these exams due to internal or external motivations, and this causes waste of resources. Majority of voting-based extreme learning machines have been proposed to solve the problem, and the ELM parameters have been optimized by artificial bee colony algorithm. Results: The proposed approach shows better performance than the extreme learning machines in terms of classification accuracy. Conclusion: Before the scheduling make-up exams, the number of students who will join the exams should be predicted by the proposed or similar approaches in order to use resources efficiently. | URI: | https://doi.org/10.17341/gazimmfd.890180 https://hdl.handle.net/20.500.13091/1691 |
ISSN: | 1300-1884 1304-4915 |
Appears in Collections: | Mühendislik ve Doğa Bilimleri Fakültesi Koleksiyonu Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collections WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collections |
Files in This Item:
File | Size | Format | |
---|---|---|---|
10.17341-gazimmfd.890180-1614479.pdf | 388.15 kB | Adobe PDF | View/Open |
CORE Recommender
Page view(s)
240
checked on Mar 20, 2023
Download(s)
88
checked on Mar 20, 2023
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.