Obserwuj
Benoît Choffin
Benoît Choffin
PhD in Computer Science (Université Paris-Saclay)
Zweryfikowany adres z lri.fr - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
DAS3H: Modeling Student Learning and Forgetting for Optimally Scheduling Distributed Practice of Skills
B Choffin, F Popineau, Y Bourda, JJ Vie
International Conference on Educational Data Mining (EDM), 2019
1302019
Automated scoring for reading comprehension via in-context bert tuning
N Fernandez, A Ghosh, N Liu, Z Wang, B Choffin, R Baraniuk, A Lan
International Conference on Artificial Intelligence in Education, 691-697, 2022
402022
Scaling Bayesian Optimization up to Higher Dimensions: a Review and Comparison of Recent Algorithms
B Choffin, N Ueda
2018 IEEE 28th International Workshop on Machine Learning for Signal …, 2018
142018
Evaluating DAS3H on the EdNet Dataset
B Choffin, F Popineau, Y Bourda, JJ Vie
AAAI 2021-The 35th Conference on Artificial Intelligence/Imagining Post …, 2021
42021
Modelling Student Learning and Forgetting for Optimally Scheduling Skill Review
B Choffin, F Popineau, Y Bourda
ERCIM News 2020 (120), 12-13, 2020
42020
Algorithmes d’espacement adaptatif de l’apprentissage pour l’optimisation de la maîtrise à long terme de composantes de connaissance
B Choffin
université Paris-Saclay, 2021
32021
Extending Adaptive Spacing Heuristics to Multi-Skill Items
B Choffin, F Popineau, Y Bourda
Journal of Educational Data Mining 13 (3), 69-102, 2021
22021
Making sense of learner behavioral, cognitive and demographic characteristics to improve learner modeling
B Choffin, A Latimier, N Ahmadi
International Congress on Technologies in Education, 2019
12019
Tuteurs intelligents: boucler la boucle
Y Bourda, C Chaudet, B Choffin, J Parmentier, F Popineau, JJ Vie
12018
PLUME: un Plugin Moodle pour Générer des Feuilles d'Exercices Personnalisées
B Choffin
Rencontres Jeunes Chercheurs en EIAH 2018, 2018
12018
Scaling Bayesian optimization up to higher dimensions: A comparison of recent algorithms
N Ueda, B Choffin
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–11