2021
DOI: 10.1007/978-3-030-80421-3_15
|View full text |Cite
|
Sign up to set email alerts
|

MOOC Next Week Dropout Prediction: Weekly Assessing Time and Learning Patterns

Abstract: Although Massive Open Online Course (MOOC) systems have become more prevalent in recent years, associated student attrition rates are still a major drawback. In the past decade, many researchers have sought to explore the reasons behind learner attrition or lack of interest. A growing body of literature recognises the importance of the early prediction of student attrition from MOOCs, since it can lead to timely interventions. Among them, most are concerned with identifying the best features for the entire cou… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
4
0
1

Year Published

2022
2022
2023
2023

Publication Types

Select...
3
3
2

Relationship

2
6

Authors

Journals

citations
Cited by 11 publications
(5 citation statements)
references
References 29 publications
(30 reference statements)
0
4
0
1
Order By: Relevance
“…Para os classificadores simples, aplicamos os algorit-mos de árvore de decisão, como os autores utilizaram em [Baker and de Carvalho 2008], como em SVM [d Baker et al 2010], KNN e redes neurais (MLP). Em termos de algoritmos de aprendizado ensemble [Yang et al 2013], o uso de random forest tem aparecido na literatura entre as abordagens mais utilizadas para tarefas de classificac ¸ão de aprendizes em outros contextos [Alamri et al 2021]. Assim, para construir nosso modelo, empregamos vários métodos de ensemble concorrentes, como segue: Random Forest (RF) [Liu et al 2012], Gradient Boosting Machine (Gradient Boosting), [Friedman 2001] Adaptive Boosting (AdaBoost) [Hastie et al 2009] e XGBoost [Chen and Guestrin 2016] para prosseguir com a análise exploratória.…”
Section: Algoritmosunclassified
“…Para os classificadores simples, aplicamos os algorit-mos de árvore de decisão, como os autores utilizaram em [Baker and de Carvalho 2008], como em SVM [d Baker et al 2010], KNN e redes neurais (MLP). Em termos de algoritmos de aprendizado ensemble [Yang et al 2013], o uso de random forest tem aparecido na literatura entre as abordagens mais utilizadas para tarefas de classificac ¸ão de aprendizes em outros contextos [Alamri et al 2021]. Assim, para construir nosso modelo, empregamos vários métodos de ensemble concorrentes, como segue: Random Forest (RF) [Liu et al 2012], Gradient Boosting Machine (Gradient Boosting), [Friedman 2001] Adaptive Boosting (AdaBoost) [Hastie et al 2009] e XGBoost [Chen and Guestrin 2016] para prosseguir com a análise exploratória.…”
Section: Algoritmosunclassified
“…Several machine-learning models were examined, and LightGBM outperformed the other models. In addition, Alamri et al [75] proposed a next-week dropout-prediction model that predicts students who do not access 80% of the course content in the following week based on their learning behavior and expressed opinions in the discussion forum. Multiple classification models were tested and AdaBoost provided the highest accuracy.…”
Section: Statistical Featuresmentioning
confidence: 99%
“…Machine learning models have been successfully used to model student's behavior (progress, test scores, academic performance, etc. ), based on study-related information [9,10], e.g., hours of studying, type of activities, etc. We propose utilizing a self-avatar to visualize and communicate the predictions of an AI model to the student.…”
Section: Related Workmentioning
confidence: 99%