It appears you don't have support to open PDFs in this web browser. To view this file, Open with your PDF reader
Abstract
In applying cognitive diagnosis models (CDM), it is important to define how mastery of the multiple skills required by a test item combine to determine item performance. The two commonly used assumptions as to a combination rule lead to the distinction between conjunctive versus compensatory models. The present work develops methods to investigate the appropriateness of the conjunctive combination rule used in many CDMs such as the DINA model. First, a linear compensatory model is developed that is a counterpart model to DINA, differing only in the skill-combination rule. This new model is referred to as the "Linear Compensatory" (LC) model. Then, a new generalized model, the "Quasi-Compensatory" (or "QUIC") model, is described. Bayesian methods are developed for estimation of the three models. Two simulation studies are conducted investigating how accurately the parameters of the models can be recovered using the estimation methods. Study 1 assumes larger values for guessing parameters to represent a multiple-choice test and Study 2 simulates an open-ended test by setting a smaller value for the guessing parameters. Finally, in Study 3 the models were applied to the well-known mixed fraction subtraction data collected by K. Tatsuoka. Results of the three studies showed that while it is usually critical to use a model that assumes the correct combination rule, the QUIC model can distinguish conjunctive from compensatory items and fit both types of items and tests well, thus overcoming the need to specify the nature of the combination rule in advance.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer





