Sein Minn

dblp:148/4909 · DBLP profile ↗
← Back
7ranked-venue papers
6as first author
3since 2021 · last 2025
0000-0001-9747-615XORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 3 first-author · 1 since 2021Databases, data management, data science and information retrieval · 3 · 3 first-authorHuman-computer interaction and ubiquitous computing · 3 · 2 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 3 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021Theory of computation · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
2 papers
Computing education · 100%
Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computing education › student modeling
knowledge tracing
0.922022
Interpretable Knowledge Tracing: Simple and Efficient Student Modeling with Causal Relations · AAAI 2022
Deep Knowledge Tracing and Dynamic Student Classification for Knowledge Tracing · ICDM 2018
Computing education
student modeling
0.722022
Interpretable Knowledge Tracing: Simple and Efficient Student Modeling with Causal Relations · AAAI 2022
Deep Knowledge Tracing and Dynamic Student Classification for Knowledge Tracing · ICDM 2018
Computing education
student performance prediction
0.612022
Interpretable Knowledge Tracing: Simple and Efficient Student Modeling with Causal Relations · AAAI 2022
Computing education › student modeling › knowledge tracing
deep knowledge tracing
0.312018
Deep Knowledge Tracing and Dynamic Student Classification for Knowledge Tracing · ICDM 2018
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models › bayesian network
bayesian network classifiers
0.212022
Interpretable Knowledge Tracing: Simple and Efficient Student Modeling with Causal Relations · AAAI 2022

Methods — techniques the papers use, named apart from their topics

data mining · 1.1ablation study · 1.1tree-augmented naive bayes · 0.6tree augmented naive bayes · 0.6recurrent neural network · 0.3
YearPublicationVenuePosition
2025 Enhanced Interpretable Knowledge Tracing for Students' Performance Prediction with Human-understandable Feature Space
Sein Minn, Roger Nkambou
AIED (5)1
2022 Interpretable Knowledge Tracing: Simple and Efficient Student Modeling with Causal Relations
abstract
Intelligent Tutoring Systems have become critically important in future learning environments. Knowledge Tracing (KT) is a crucial part of that system. It is about inferring the skill mastery of students and predicting their performance to adjust the curriculum accordingly. Deep Learning based models like Deep Knowledge Tracing (DKT) and Dynamic Key-Value Memory Network (DKVMN) have shown significant predictive performance compared with traditional models like Bayesian Knowledge Tracing (BKT) and Performance Factors Analysis (PFA). However, it is difficult to extract psychologically meaningful explanations from the tens of thousands of parameters in neural networks, that would relate to cognitive theory. There are several ways to achieve high accuracy in student performance prediction but diagnostic and prognostic reasonings are more critical in learning science. In this work, we present Interpretable Knowledge Tracing (IKT), a simple model that relies on three meaningful features: individual skill mastery, ability profile (learning transfer across skills) and problem difficulty by using data mining techniques. IKT’s prediction of future student performance is made using a Tree Augmented Naive Bayes Classifier (TAN), therefore its predictions are easier to explain than deep learning based student models. IKT also shows better student performance prediction than deep learning based student models without requiring a huge amount of parameters. We conduct ablation studies on each feature to examine their contribution to student performance prediction. Thus, IKT has great potential for providing adaptive and personalized instructions with causal reasoning in real-world educational systems.
Sein Minn, Jill-Jênn Vie, Koh Takeuchi 0001, Hisashi Kashima, Feida Zhu 0001
AAAI1
2022 Privacy-Preserving Synthetic Educational Data Generation
Jill-Jênn Vie, Tomas Rigaux, Sein Minn
EC-TEL3
2019 Dynamic Student Classiffication on Memory Networks for Knowledge Tracing
Sein Minn, Michel C. Desmarais, Feida Zhu 0001, Jing Xiao 0006, Jianzong Wang
PAKDD (2)1
2018 Deep Knowledge Tracing and Dynamic Student Classification for Knowledge Tracing
abstract
In Intelligent Tutoring System (ITS), tracing the student's knowledge state during learning has been studied for several decades in order to provide more supportive learning instructions. In this paper, we propose a novel model for knowledge tracing that i) captures students' learning ability and dynamically assigns students into distinct groups with similar ability at regular time intervals, and ii) combines this information with a Recurrent Neural Network architecture known as Deep Knowledge Tracing. Experimental results confirm that the proposed model is significantly better at predicting student performance than well known state-of-the-art techniques for student modelling.
Sein Minn, Yi Yu 0001, Michel C. Desmarais, Feida Zhu 0001, Jill-Jênn Vie
ICDM1
2016 Refinement of a Q-matrix with an Ensemble Technique Based on Multi-label Classification Algorithms
Sein Minn, Michel C. Desmarais, Shunkai Fu
EC-TEL1
2014 Efficient learning of general Bayesian network Classifier by Local and Adaptive Search
abstract
General Bayesian network classifier (GBNC) contains only features necessary for classification, so an ideal structure learning solution is to learn GBNC without having to learn the whole Bayesian network (BN). A local search based algorithm called LAS-GBNC is proposed. Given faithfulness assumption, LAS-GBNC relies on the information about each variable's appearance in the so-called d-separator(cut set) to sort candidate CI tests dynamically, performing `effective' ones with priority. Experimental studies indicate that (1) LAS-GBNC achieves the same quality of networks as PC and IPC-BNC, (2)It is much more efficient than PC due to its local search design, and (3) It is obviously faster than IPC-BNC because of its adaptive search strategy.
Sein Minn, Shunkai Fu, Michel C. Desmarais
DSAA1