Boosted Decision Tree for Q-Matrix Refinement [Konferenzbericht] Paper presented at the International Conference on Educational Data Mining (EDM) (9th, Raleigh, NC, Jun 29-Jul 2, 2016).

Autor/inn/en	Xu, Peng; Desmarais, Michel C.
Titel	Boosted Decision Tree for Q-Matrix Refinement [Konferenzbericht] Paper presented at the International Conference on Educational Data Mining (EDM) (9th, Raleigh, NC, Jun 29-Jul 2, 2016).
Quelle	(2016), (5 Seiten) PDF als Volltext kostenfreie Datei Verfügbarkeit
Sprache	englisch
Dokumenttyp	gedruckt; online; Monographie
Schlagwörter	Matrices; Q Methodology; Psychometrics; Decision Making; Mathematics; Models; Prediction; Validity; Item Response Theory + Suchen Sie Ihr Suchwort? Matrizenrechnung; Psychometry; Psychometrie; Decision-making; Entscheidungsfindung; Mathematik; Analogiemodell; Vorhersage; Gültigkeit; Item-Response-Theorie
Abstract	In recent years, substantial improvements were obtained in the effectiveness of data driven algorithms to validate the mapping of items to skills, or the Q-matrix. In the current study we use ensemble algorithms on top of existing Q-matrix refinement algorithms to improve their performance. We combine the boosting technique with a decision tree. The results show that the improvements from both the decision tree and Adaboost combined are better than the decision tree alone and yield substantial gains over the best performance of individual Q-matrix refinement algorithm. [For the full proceedings, see ED592609.] (As Provided).
Anmerkungen	International Educational Data Mining Society. e-mail: admin@educationaldatamining.org; Web site: http://www.educationaldatamining.org
Erfasst von	ERIC (Education Resources Information Center), Washington, DC
Update	2020/1/01