NotesFAQContact Us
Collection
Advanced
Search Tips
Audience
Researchers1
Laws, Policies, & Programs
Assessments and Surveys
Armed Services Vocational…1
What Works Clearinghouse Rating
Showing all 9 results Save | Export
Peer reviewed Peer reviewed
Direct linkDirect link
Hayat Sahlaoui; El Arbi Abdellaoui Alaoui; Said Agoujil; Anand Nayyar – Education and Information Technologies, 2024
Predicting student performance using educational data is a significant area of machine learning research. However, class imbalance in datasets and the challenge of developing interpretable models can hinder accuracy. This study compares different variations of the Synthetic Minority Oversampling Technique (SMOTE) combined with classification…
Descriptors: Sampling, Classification, Algorithms, Prediction
Matthew Jannetti; Amy Carroll-Scott; Erikka Gilliam; Irene Headen; Maggie Beverly; Félice Lê-Scherban – Field Methods, 2023
Place-based initiatives often use resident surveys to inform and evaluate interventions. Sampling based on well-defined sampling frames is important but challenging for initiatives that target subpopulations. Databases that enumerate total population counts can produce overinclusive sampling frames, resulting in costly outreach to ineligible…
Descriptors: Sampling, Probability, Definitions, Prediction
Tamara Broderick; Andrew Gelman; Rachael Meager; Anna L. Smith; Tian Zheng – Grantee Submission, 2022
Probabilistic machine learning increasingly informs critical decisions in medicine, economics, politics, and beyond. To aid the development of trust in these decisions, we develop a taxonomy delineating where trust in an analysis can break down: (1) in the translation of real-world goals to goals on a particular set of training data, (2) in the…
Descriptors: Taxonomy, Trust (Psychology), Algorithms, Probability
Peer reviewed Peer reviewed
Direct linkDirect link
Ji-Eun Lee; Amisha Jindal; Sanika Nitin Patki; Ashish Gurung; Reilly Norum; Erin Ottmar – Interactive Learning Environments, 2024
This paper demonstrated how to apply Machine Learning (ML) techniques to analyze student interaction data collected in an online mathematics game. Using a data-driven approach, we examined 1) how different ML algorithms influenced the precision of middle-school students' (N = 359) performance (i.e. posttest math knowledge scores) prediction and 2)…
Descriptors: Teaching Methods, Algorithms, Mathematics Tests, Computer Games
Ji-Eun Lee; Amisha Jindal; Sanika Nitin Patki; Ashish Gurung; Reilly Norum; Erin Ottmar – Grantee Submission, 2023
This paper demonstrated how to apply Machine Learning (ML) techniques to analyze student interaction data collected in an online mathematics game. Using a data-driven approach, we examined: (1) how different ML algorithms influenced the precision of middle-school students' (N = 359) performance (i.e. posttest math knowledge scores) prediction; and…
Descriptors: Teaching Methods, Algorithms, Mathematics Tests, Computer Games
Peer reviewed Peer reviewed
Direct linkDirect link
Anika Alam; A. Brooks Bowden – Society for Research on Educational Effectiveness, 2024
Background: The importance of high school completion for jobs and postsecondary opportunities is well- documented. Combined with federal laws where high school graduation rate is a core performance indicator, school systems and states face pressure to actively monitor and assess high school completion. This proposal employs machine learning…
Descriptors: Dropout Characteristics, Prediction, Artificial Intelligence, At Risk Students
Ji-Eun Lee; Amisha Jindal; Sanika Nitin Patki; Ashish Gurung; Reilly Norum; Erin Ottmar – Grantee Submission, 2022
This paper demonstrates how to apply Machine Learning (ML) techniques to analyze student interaction data collected in an online mathematics game. We examined: (1) how different ML algorithms influenced the precision of middle-school students' (N = 359) performance prediction; and (2) what types of in-game features were associated with student…
Descriptors: Teaching Methods, Algorithms, Mathematics Tests, Computer Games
Gagnon-Bartsch, J. A.; Sales, A. C.; Wu, E.; Botelho, A. F.; Erickson, J. A.; Miratrix, L. W.; Heffernan, N. T. – Grantee Submission, 2019
Randomized controlled trials (RCTs) admit unconfounded design-based inference--randomization largely justifies the assumptions underlying statistical effect estimates--but often have limited sample sizes. However, researchers may have access to big observational data on covariates and outcomes from RCT non-participants. For example, data from A/B…
Descriptors: Randomized Controlled Trials, Educational Research, Prediction, Algorithms
Mislevy, Robert J. – 1985
A method for drawing inferences from complex samples is based on Rubin's approach to missing data in survey research. Standard procedures for drawing such inferences do not apply when the variables of interest are not observed directly, but must be inferred from secondary random variables which depend on the variables of interest stochastically.…
Descriptors: Algorithms, Data Interpretation, Estimation (Mathematics), Latent Trait Theory