MétaCan
Menu
Retour à la cohorte
Enregistrement W2146913654

Partial Order Knowledge Structures for CAT Applications

2007· article· en· W2146913654 sur OpenAlexaffabout
Michel C. Desmarais, Xiaoming Pu

Notice bibliographique

Revuenon disponible
Typearticle
Langueen
DomaineComputer Science
ThématiqueBayesian Modeling and Causal Inference
Établissements canadiensPolytechnique Montréal
Organismes subventionnairesnon disponible
Mots-clésBayesian networkComputer scienceBayesian probabilityVariable-order Bayesian networkMachine learningScalabilityReliability (semiconductor)Artificial intelligenceData miningBayesian inferenceData science
DOInon disponible

Résumé

récupéré en direct d'OpenAlex

Bayesian and graph models of student knowledge assessment have made significant progress in the last decadeand are challenging the more traditional IRT approach for CAT applications. We review some of the most prominent frameworks in Bayesian knowledge assessment and how they compare to IRT and introduce one such framework in the family of Bayesian models, the POKS (Partial Order Knowlege Structure). A comparison of the POKS approach to IRT and a Bayesian Network approach showed that it can perform detailed knowledge assessment at a computational cost of orders of magnitude less than a Bayesian Network and IRT. The assessment accuracy results of experiments show that it is at least as good as a one-dimensional IRT model and generally outperforms a Bayesian Network with small data sets. However, a number of challenges remain for the POKS approach as well as for other Bayesian frameworks in CAT applications. One of the most important issue is how scalable the approaches are over a large number of items. Another issue is the estimation of reliability and error margins, which are currently almost ignored by these approaches. We review these challenges and the work ahead. Acknowledgment Presentation of this paper at the 2007 Conference on Computerized Adaptive Testing was supported in part with funds from GMAC®. Copyright © 2007 by the Authors All rights reserved. Permission is granted for non-commercial use. Citation Desmarais, M. C., Pu, X, & Blais, J.-G. (2007). Partial Order Knowledge Structures for CAT Applications. In D. J. Weiss (Ed.), Proceedings of the 2007 GMAC Conference on Computerized Adaptive Testing. Retrieved [date] from www.psych.umn.edu/psylabs/CATCentral/ Author Contact Michel C. Desmarais or Xiaoming Pu, Polytechnique Montreal, C.P. 6079, succ. Centre-Ville, Montreal, Quebec, Canada, H3C 3A7. Email : michel.desmarais@polymtl.ca, xiaoming.pu@polymtl.ca, jeanguy.blais@umontreal.ca Partial Order Knowledge Structures for CAT Applications Adaptive testing can be considered one of the first applications of what is currently a very active research topic, that of adaptive and personalized interfaces. The principle of adaptive interfaces is based on constructing a user model of an application and then adapting the performance of the application to the model. This is exactly what adaptive testing does. It constructs a model of the respondent’s knowledge and adapts the administered items as a function of the model, generally with the specific goal of making a knowledge assessment with a minimum number of items. Although the area of adaptive interfaces includes a wide range of adaptation, from user preferences to user intentions (McTear 1993), it remains that computerized adaptive testing (CAT) might be the very first large-scale application of the basic principle of these applications: to construct a user model and adapt the performance of the application as a function of the model. The domains of CAT and adaptive interfaces evolved separately from each other, largely unaware of each other’s developments. The area of adaptive interfaces and, in particular, that of adaptive learning environments gave rise to several models of learner knowledge and several techniques for its evaluation (Self, 1988). While item response theory (IRT) was rapidly developing in the area of adaptive testing, the area of intelligent tutorials was developing its own approaches for representing and assessing competences for adaptive learning environments (Carr & Goldstein, 1977). Most of these efforts were based on rule-based systems and aimed at providing a very detailed assessment of learner knowledge. The main feature of these models was to arrive at an accurate assessment that referred, not only to the precise concepts mastered, but also to incorrect concepts, or mal-rules (Payne & Squibb, 1990). These models had the advantage of providing a high level of granularity in that they could provide a very precise assessment of acquired or missing knowledge/competences; however, they did not integrate any notion of uncertainty, which is inherent to the modeling of knowledge. Inversely, work in the area of psychometrics and IRT models incorporated, from the outset, the notion of uncertainty and were devoted mainly to estimating the reliability of the models and the confidence intervals used to make an assessment with a known degree of certainty. However, the granularity of IRT-based models still remains low and generally limited to one dimension, or, in the case of more recent work on multidimensional IRT, to a few dimensions simultaneously, well below the level of granularity that can be attained with the rule-based models of intelligent tutorial environments. These divergences are easily explained considering that, in the case of psychometrics, the most frequent requirements originate from the context of summative evaluation and consist in determining whether the respondent will pass or fail a test. The requirements of intelligent tutorial environments are aimed, instead, at determining the learning problems of the learner in order to select very specific capsules of pedagogical content aimed at remedying incorrect concepts or guiding the learner toward a more advanced content. The respective requirements of the two domains are, therefore, very different, which explains in large part the little influence they have had on each other. The link between the two domains emerged from work on graphical models of knowledge and we mention, among others, that of Almond and Mislevy (1999), Mislevy and Gitomer

Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.

Comment cette classification a été obtenuedéplier

Prédiction machine sur la base complète

Imitation des enseignants

Ni prévalence calibrée, ni vérité terrain. Validation humaine à venir. Le volet Gemma est une étiquette directe du modèle pour chaque travail de la base, lue sur la notice réduite au titre. Le volet Codex est un classifieur appris des 10 348 étiquettes directes de Codex et calibré sur les taux pondérés de l'échantillon; les champs sans appui suffisant ne portent aucun appel Codex. Le mode candidate est l'union des deux volets; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont pas des étiquettes humaines.

score de la tête « metaresearch » (Codex)0,004
score de la tête « metaresearch » (Gemma)0,035
Version: metacan-v3-hybrid-931329e0061cStatut de validation: machine_predicted_unvalidated
Catégories candidatesaucune
Catégories consensuellesaucune
DomaineSignal candidat: aucune · Signal consensuel: aucune
Devis d'étudeSignal candidat: Théorique ou conceptuel · Signal consensuel: aucune
GenreSignal candidat: Empirique · Signal consensuel: aucune
Score de désaccord entre enseignants0,009
Score d'incertitude au seuil0,029

Scores du classifieur distillé par catégorie (deux têtes)

CatégorieCodexGemma
Métarecherche0,0040,035
Méta-épidémiologie (sens strict)0,0010,001
Méta-épidémiologie (sens large)0,0010,001
Bibliométrie0,0030,003
Études des sciences et des technologies0,0010,001
Communication savante0,0040,009
Science ouverte0,0020,004
Intégrité de la recherche0,0020,003
Charge utile insuffisante (le modèle a refusé de juger)0,0090,002

Scores machine (provisoires)

Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.

Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.

Tête enseignante Opus0,035
Tête enseignante GPT0,326
Écart entre enseignants0,291 · la distance entre les deux têtes enseignantes sur ce seul travail
Statut de validationscore_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découle

Classification

machine, non validée

Prédiction automatique; un appel candidat d’une seule source (Gemma direct ou Codex distillé), pas un consensus.

Les modèles n’ont appliqué aucune catégorie : rien dans la taxonomie ne correspondait à ce travail.
Devis d'étudeThéorique ou conceptuel
Domainenon disponible
GenreEmpirique

Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».

En bref

Citations3
Publié2007
Routes d'admission2
Résumé présentoui

Explorer davantage

Même sujetBayesian Modeling and Causal InferenceTravaux en français237 207