A Note on the Relationship of the Shannon Entropy Procedure and the Jensen–Shannon Divergence in Cognitive Diagnostic Computerized Adaptive Testing

Abstract

The purpose of this study is to investigate the relationship between the Shannon entropy procedure and the Jensen–Shannon divergence (JSD) that are used as item selection criteria in cognitive diagnostic computerized adaptive testing (CD-CAT). Because the JSD itself is defined by the Shannon entropy, we apply the well-known relationship between the JSD and Shannon entropy to establish a relationship between the item selection criteria that are based on these two measures. To understand the relationship between these two item selection criteria better, an alternative way is also provided. Theoretical derivations and empirical examples have shown that the Shannon entropy procedure and the JSD in CD-CAT have a linear relation under cognitive diagnostic models. Consistent with our theoretical conclusions, simulation results have shown that two item selection criteria behaved quite similarly in terms of attribute-level and pattern recovery rates under all conditions and they selected the same set of items for each examinee from an item bank with item parameters drawn from a uniform distribution U(0.1, 0.3) under post hoc simulations. We provide some suggestions for future studies and a discussion of relationship between the modified posterior-weighted Kullback–Leibler index and the G-DINA (generalized deterministic inputs, noisy “and” gate) discrimination index.

Summative assessments are typically used for grading and accountability purposes, and formative assessments are often used for supporting student learning (Laveault & Allal, 2016). Researchers and practitioners began to focus on formative assessments for student learning, rather than focus solely on summative assessments because many evidences showed that formative assessments produce significant and often substantial learning gains and improve student confidence and achievement (Black & Wiliam, 1998; Laveault & Allal, 2016). Cognitive diagnosis assessment (CDA) can be regarded as a kind of formative assessments because it is intended to promote assessment for learning to modify instruction and learning in classrooms by providing the formative diagnostic information about students’ cognitive strengths and weaknesses (Jang, 2008; Leighton & Gierl, 2007). CDA has received increasing attention in recent years (Leighton & Gierl, 2007; Rupp et al., 2010; K. K. Tatsuoka, 2009), especially since the No Child Left Behind Act of 2001 mandated the selection and use of diagnostic assessments to improve teaching and learning and the new federal grant program known as “Race to the Top” (RTTT) has led into a new era of K–12 assessments which emphasized both accountability and instructional improvement (Chang, 2012).

Computerized adaptive testing (CAT) has become a popular mode of many summative and formative assessments (Quellmalz & Pellegrino, 2009). As a method of administering test items, CAT tailors the item difficulty to the ability level of the individual examinee (Chang & Ying, 2007). It is attractive to practitioners because it yields a high measurement precision with a short test. In the framework of CAT, cognitive diagnostic computerized adaptive testing (CD-CAT) is also a popular mode of online testing for cognitive diagnosis, as it can help one make informed decisions about the next steps in instruction for each student and greatly facilitate individualized learning (Chang, 2015) and provide many benefits to support formative assessments (Gierl & Lai, 2018). Particularly, the U.S. National Education Technology Plan 2017 with the title of “Reimagining the Role of Technology in Education” (U.S. Department of Education, 2017) emphasizes that technology can help us redefine assessment to meet the needs of the learner in a variety of ways. For technology-based formative assessments or CAT, test items are adapted to learner’s ability and knowledge during the testing process. Thus, CAT can provide real-time reporting of results during the instructional process, which is crucial for personalized learning (Chen & Chang, 2018).

A key ingredient in CD-CAT is the item selection index. Researchers have attempted to investigate many item selection indices. The first type of index is based on the Kullback–Leibler (KL) information, such as the KL index (Cheng, 2009; McGlohen & Chang, 2008; C. Tatsuoka & Ferguson, 2003; Xu et al., 2003), the likelihood- or posterior-weighted KL (LWKL or PWKL) index and the hybrid KL index (Cheng, 2009), the restrictive progressive or threshold PWKL index (Wang et al., 2011), the aggregate ranked information index and the aggregate standardized information index (Wang et al., 2014), the modified PWKL (MPWKL) index (Kaplan et al., 2015), the KL expected discrimination index (W. Y. Wang et al., 2015), the posterior-weighted cognitive diagnostic model (CDM) discrimination index and the posterior-weighted attribute-level CDM discrimination index (Zheng & Chang, 2016), and the information product index (Zheng et al., 2018). The second is based on the Shannon entropy, called the Shannon entropy (SHE) procedure (Cheng, 2009; McGlohen & Chang, 2008; C. Tatsuoka, 2002; C. Tatsuoka & Ferguson, 2003; Xu et al., 2003, 2016). The third is based on the mutual information, including the expected mutual information index (Wang, 2013) and the Jensen–Shannon divergence (JSD) index (Kang et al., 2017; Minchen & de la Torre, 2016; Yigit et al., 2018). There are other indices, such as the generalized deterministic inputs, noisy “and” gate (G-DINA; de la Torre, 2011) model discrimination index (GDI; Kaplan et al., 2015), the rate function approach (Liu et al., 2015), the halving algorithm (C. Tatsuoka & Ferguson, 2003; W. Y. Wang et al., 2015; Zheng & Wang, 2017), and so on. Yigit et al. (2018) has proved that the mutual information index and the JSD index are equivalent. Although the previous simulation studies showed that the SHE and the JSD or mutual information perform quite similarly, the main purpose of this study is to describe the theoretical relationship between the SHE procedure and the JSD index.

CDMs

Before introducing item selection indices for CD-CAT, the general concept of CDMs and the G-DINA model as a kind of general CDMs are described here. CDMs have been defined by Rupp and Templin (2008) as “probabilistic, confirmatory multidimensional latent variable models with a simple or complex loading structure” (p. 226). The loading structure for a CDM is represented by its Q-matrix (K. K. Tatsuoka, 1983, 2009). The entries of a Q-matrix indicate 1 or 0, in which $q_{jk}=1$ when item j involves attribute k for answering item j correctly and $q_{jk}=0$ otherwise. CDMs define an item response function of a Q-matrix, examinee’s discrete latent variables, and item parameters to predict the probability of an observable categorical response to an item. This study only focuses on CDMs designed to handle dichotomous responses. For a dichotomous CDM, the form of an item response function for a binary response variable is denoted by $P_{ju}({\mathrm{\alpha }}_i)=P(U_{ij}=u|{\mathrm{\alpha }}_i,q_j,{\mathrm{\beta }}_j)$ , where $u\in \{0,1\},$ $q_j$ qj is the j th row of a Q-matrix, and ${\mathrm{\beta }}_j$ is item parameters for item j. Note that this study will use $P_{ju}({\mathrm{\alpha }}_i)$ to discuss the theoretical relationship between the SHE procedure and the JSD index. While the G-DINA model and other CDMs are described below only for showing details about different item response functions for dichotomous CDMs.

Let $K_j^{*}={\sum }_{k=1}^K{q}_{jk}$ denote the number of required attributes for item j, where K is the number of attributes of a test. For $K$ attributes, there are $2^K$ distinct attribute patterns in the universal set of knowledge states, attribute patterns, or latent classes. Let ${\mathrm{\alpha }}_i$ denote an attribute pattern from the universal set of knowledge states. In the G-DINA model, item j that measures $K_j^{*}$ attributes partitions the $2^K$ distinct attribute patterns into $2^{K_j^{*}}$ latent groups. To simplify the notation, let ${\mathrm{\alpha }}_{ij}^{*}$ be the reduced attribute pattern of the full attribute pattern ${\mathrm{\alpha }}_i$ with respect to the required attributes for item j. Let $U_{ij}$ be the response of examinee i to item j. We define $P_{ju}({\mathrm{\alpha }}_i)=P(U_{ij}=u|{\mathrm{\alpha }}_{ij}^{*})$ to be the probability distribution of the binary random variable $U_{ij}$ , where $P_{j1}({\mathrm{\alpha }}_i)$ and $P_{j0}({\mathrm{\alpha }}_i)=1-P_{j1}({\mathrm{\alpha }}_i)$ are the probabilities of getting a right answer and wrong answer on item j by examinee $i$ with full attribute pattern ${\mathrm{\alpha }}_i$ or reduced attribute pattern ${\mathrm{\alpha }}_{ij}^{*}$ . For the G-DINA model, the probability of correctly answering item $j$ by examinee $i$ is given by de la Torre (2011) and Ma et al. (2016).

$$\begin{array}{l}g\left[P_{j1}\left({\mathrm{\alpha }}_i\right)\right]={\mathrm{\delta }}_{j0}+\sum _{k=1}^{K_j^{*}}{\mathrm{\delta }}_{j1}{\mathrm{\alpha }}_{ik}^{*}\\ +\sum _{k=1}^{K_j^{*}-1}\sum _{k\prime =k+1}^{K_j^{*}}{\mathrm{\delta }}_{jkk\prime }{\mathrm{\alpha }}_{ik}^{*}{\mathrm{\alpha }}_{ik\prime }^{*}+\dots +{\mathrm{\delta }}_{j12\cdots K_j^{*}}\prod _{k=1}^{K_j^{*}}{\mathrm{\alpha }}_{ik}^{*},\end{array}$$

(1)

where ${\mathrm{\delta }}_{j0}$ is the intercept for item $j$ , ${\mathrm{\delta }}_{j1}$ is the main effect due to ${\mathrm{\alpha }}_{ik}^{*}$ , ${\mathrm{\delta }}_{jkk\prime }$ is the interaction effect due to ${\mathrm{\alpha }}_{ik}^{*}$ and ${\mathrm{\alpha }}_{ik\prime }^{*}$ and ${\mathrm{\delta }}_{j12\cdots K_j^{*}}$ is the interaction effect due to ${\mathrm{\alpha }}_{i1}^{*},\dots ,{\mathrm{\alpha }}_{i{K}_j^{*}}^{*}$ . In addition, link function $g[P_{ju}({\mathrm{\alpha }}_i)]$ can be formulated using the logit, log, and identity links. The logit link results in a general model which is equivalent to the log-linear CDM (Henson et al., 2009) and can be viewed as a special case of the general diagnostic model (GDM; von Davier, 2005, 2008). The resulting model from the log link function is referred to as the log CDM (de la Torre, 2011).

For the identity link, that is $g[P_{ju}({\mathrm{\alpha }}_i)]=P_{ju}({\mathrm{\alpha }}_i)$ , the “deterministic input; noisy ‘and’ gate” (DINA) model (de la Torre & Douglas, 2004; Haertel, 1989; Junker & Sijtsma, 2001), the “deterministic input; noisy ‘or’ gate” (DINO) model (Templin & Henson, 2006), and the additive CDM (A-CDM) can be obtained from the G-DINA model when appropriate constraints are applied. For example, the item response function of the DINA model is $P_{j1}({\mathrm{\alpha }}_i)={\mathrm{\delta }}_{j0}+{\mathrm{\delta }}_{j12\cdots K_j^{*}}{\prod }_{k=1}^{K_j^{*}}{\mathrm{\alpha }}_{ik}^{*},$ by setting all lower-order interaction terms to zero and by taking ${\mathrm{\delta }}_{j0}=g_j$ and ${\mathrm{\delta }}_{j12\cdots K_j^{*}}=1-s_j-g_j$ . The parameter $g_j$ is the probability of correctly guessing the answer if an examinee lacks at least one of the required attributes, and the parameter $s_j$ refers to the probability of slipping and incorrectly answering the item if an examinee has mastered all the required attributes. The DINA model is a parsimonious and interpretable model that requires only two parameters for each item regardless of the number of attributes being considered.

Overview of Two Item Selection Indices for CD-CAT

SHE Procedure

After an item bank has been calibrated with a CDM, one must determine how to choose items for examinees from the item bank. CD-CAT employs algorithms to select items sequentially on the basis of examinee’s responses, which is designed to classify student’s attribute pattern accurately with a short test. The SHE procedure (Cheng, 2009) and the JSD index (Minchen & de la Torre, 2016; Yigit et al., 2018) are described below.

Suppose that the prior is chosen as ${\mathrm{\pi }}_0({\mathrm{\alpha }}_c)$ for attribute pattern ${\mathrm{\alpha }}_c$ , where $c=1,2,\dots ,2^K$ . For examinee $i$ , suppose that $t$ items are selected, the vector of corresponding item responses is denoted as ${\mathbf{u}}_i^{(t)}$ , and a set $R_i^{(t)}$ represents the set of available items at this stage. The posterior distribution $\mathrm{\pi }({\mathrm{\alpha }}_c|{\mathbf{u}}_i^{(t)})$ then becomes

$${\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_c\right)=\mathrm{\pi }\left({\mathrm{\alpha }}_c|{\mathbf{u}}_i^{(t)}\right)=\frac{{\mathrm{\pi }}_0\left({\mathrm{\alpha }}_c\right)L\left({\mathbf{u}}_i^{(t)}|{\mathrm{\alpha }}_c\right)}{\sum _{c=1}^{2^K}{\mathrm{\pi }}_0\left({\mathrm{\alpha }}_c\right)L\left({\mathbf{u}}_i^{(t)}|{\mathrm{\alpha }}_c\right)},$$

(2)

where $L({\mathbf{u}}_i^{(t)}|{\mathrm{\alpha }}_c)$ is the likelihood function, and it is the product of each item response function if the assumptions of local independence are satisfied. The SHE of the posterior distribution π _i,t can then be written as

$$H\left({\mathrm{\pi }}_{i,t}\right)=-\sum _{c=1}^{2^K}{\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_c\right)\log {\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_c\right).$$

(3)

Assuming that ${\mathrm{\pi }}_{i,t}({\mathrm{\alpha }}_c)$ is an updated prior probability distribution and $U_{ij}=u$ is an item response for candidate item $j$ in $R_i^{(t)}$ , the posterior distribution ${\mathrm{\pi }}_{i,t+1}$ then becomes

$${\mathrm{\pi }}_{i,t+1}\left({\mathrm{\alpha }}_c\right)={\mathrm{\pi }}_{i,t+1}\left({\mathrm{\alpha }}_c|{\mathbf{u}}_i^{\left(t\right)},U_{ij}=u\right)=\frac{{\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_c\right)P_{ju}\left({\mathrm{\alpha }}_c\right)}{\sum _{c=1}^{2^K}{\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_c\right)P_{ju}\left({\mathrm{\alpha }}_c\right)}.$$

(4)

From the last term, ${\mathrm{\pi }}_{i,t+1}({\mathrm{\alpha }}_c|{\mathbf{u}}_i^{\left(t\right)},U_{ij}=u)$ can be rewritten as ${\mathrm{\pi }}_{i,t+1}({\mathrm{\alpha }}_c^{(t)}|U_{ij}=u)$ , where ${\mathrm{\alpha }}_c^{(t)}$ has an updated prior distribution π _i,t .

By considering the uncertainty of item response $U_{ij}$ , the marginal probability distribution of item response on item $j$ given the probability distribution π _i,t can be computed as follows

$$\begin{array}{l}P\left(U_{ij}=u|{\mathbf{u}}_i^{\left(t\right)}\right)=\sum _{c=1}^{2^K}P\left(U_{ij}=u,{\mathrm{\alpha }}_c|{\mathbf{u}}_i^{\left(t\right)}\right)\\ =\sum _{c=1}^{2^K}{\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_c\right)P_{ju}\left({\mathrm{\alpha }}_c\right),\end{array}$$

(5)

where the second term follows directly from $P(U_{ij}=u|{\mathbf{u}}_i^{\left(t\right)},{\mathrm{\alpha }}_c)=P(U_{ij}=u|{\mathrm{\alpha }}_c),$ which can be derived from the assumption of local independence; as the current posterior distribution π _i,t can be viewed as a new prior for ${\mathrm{\alpha }}_c^{(t)}$ after having seen test data ${\mathbf{u}}_i^{\left(t\right)}$ , $P(U_{ij}=u|{\mathbf{u}}_i^{\left(t\right)})$ can be simplified to $P(U_{ij}=u)={\sum }_{c=1}^{2^K}{\mathrm{\pi }}_{i,t}({\mathrm{\alpha }}_c^{(t)})P_{ju}({\mathrm{\alpha }}_c^{(t)})$ when ${\mathrm{\alpha }}_c^{(t)}$ is substituted for ${\mathrm{\alpha }}_c$ in the last term.

The next item to be selected for examinee $i$ by the SHE is the one in $R_i^{(t)}$ that minimizes the expected SHE:

$$SH{E}_{ij}=\sum _{u=0}^{1}P\left(U_{ij}=u|{\mathbf{u}}_i^{\left(t\right)}\right)H\left({\mathrm{\pi }}_{i,t+1}\left({\mathrm{\alpha }}_c|{\mathbf{u}}_i^{\left(t\right)},U_{ij}=u\right)\right).$$

(6)

As shown above, $P(U_{ij}=u|{\mathbf{u}}_i^{\left(t\right)})$ and ${\mathrm{\pi }}_{i,t+1}({\mathrm{\alpha }}_c|{\mathbf{u}}_i^{\left(t\right)},U_{ij}=u),$ respectively, become $P(U_{ij}=u)$ and ${\mathrm{\pi }}_{i,t+1}({\mathrm{\alpha }}_c^{(t)}|U_{ij}=u)$ . Let $H({\mathrm{\alpha }}_c^{(t)}|U_{ij})$ be the conditional entropy of ${\mathrm{\alpha }}_c^{(t)}$ given $U_{ij}$ . From the definition of conditional entropy (Cover & Thomas, 2006), $H({\mathrm{\alpha }}_c^{(t)}|U_{ij})$ is defined as the weighted sum of $H({\mathrm{\alpha }}_c^{(t)}|U_{ij}=u)$ over each possible value of $u$ taken by the random variable $U_{ij}$ , using $P(U_{ij}=u)$ as the weights. Thus, $SH{E}_{ij}$ can be considered as the conditional entropy $H({\mathrm{\alpha }}_c^{(t)}|U_{ij})$ of ${\mathrm{\alpha }}_c^{(t)}$ given $U_{ij}$ .

JSD Index

The JSD as a new class of information measures based on the SHE was introduced by Lin (1991) to measure the overall difference of any finite number of distributions. Let $P_{ju}({\mathrm{\alpha }}_1),P_{ju}({\mathrm{\alpha }}_2),\dots ,P_{ju}({\mathrm{\alpha }}_{2^K})$ be $2^K$ item response functions with weights of prior probabilities ${\mathrm{\pi }}_{i,t}({\mathrm{\alpha }}_1),{\mathrm{\pi }}_{i,t}({\mathrm{\alpha }}_2),\dots ,{\mathrm{\pi }}_{i,t}({\mathrm{\alpha }}_{2^K})$ , respectively. By the definition of the generalized JSD in Equation 5.1 of the paper of Lin (1991), or from Equations A.3, A.4, and A.5 in online appendices of the paper of Yigit et al. (2018), the JSD for item $j$ can be written as

$$JS{D}_{ij}=H\left(P\left(U_{ij}=u|{\mathbf{u}}_i^{\left(t\right)}\right)\right)-\sum _{c=1}^{2^K}{\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_c\right)H\left(P_{ju}\left({\mathrm{\alpha }}_c\right)\right),$$

(7)

where

$$\begin{array}{l}H\left(P\left(U_{ij}=u|{\mathbf{u}}_i^{\left(t\right)}\right)\right)=-\sum _{u=0}^1\left[\sum _{c=1}^{2^K}{\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_c\right)P_{ju}\left({\mathrm{\alpha }}_c\right)\right]\log \\ \left[\sum _{c=1}^{2^K}{\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_c\right)P_{ju}\left({\mathrm{\alpha }}_c\right)\right],\end{array}$$

(8)

and

$$\begin{array}{l}\sum _{c=1}^{2^K}{\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_c\right)H\left(P_{ju}\left({\mathrm{\alpha }}_c\right)\right)=\\ -\sum _{c=1}^{2^K}\left[{\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_c\right)\left[\sum _{u=0}^1{P}_{ju}\left({\mathrm{\alpha }}_c\right)\log P_{ju}\left({\mathrm{\alpha }}_c\right)\right]\right].\end{array}$$

(9)

The next item to be administered for examinee $i$ is the one in $R_i^{(t)}$ that maximizes $JS{D}_{ij}$ . Yigit et al. (2018) have proved that $JS{D}_{ij}$ can be considered as the mutual information $I({\mathrm{\alpha }}_i;U_{ij})=I(U_{ij};{\mathrm{\alpha }}_i)$ between the two discrete random variables of ${\mathrm{\alpha }}_i$ and $U_{ij}$ . Thus, the JSD index is also a measure of the amount of information one random variable ${\mathrm{\alpha }}_i$ contains about another $U_{ij}$ .

Similar results have been observed by Kang et al. (2017) within the framework of dual-objective CD-CAT (Kang et al., 2017; McGlohen & Chang, 2008; Wang et al., 2014; Zheng et al., 2018). For simultaneously estimating examinees’ ${\mathrm{\alpha }}_i$ and general ability ${\mathrm{\theta }}_i$ , the dual-objective CD-CAT is based on a CDM and an item response theory model. In other words, item response $U_{ij}$ has two Bernoulli distributions $P_{ju}({\mathrm{\alpha }}_i)$ and $P_{ju}({\mathrm{\theta }}_i)$ . Take the two-parameter logistic model as an example, the probability of responding correctly to item $j$ is defined as $P_{j1}({\mathrm{\theta }}_i)=1/(1+\exp (-D{a}_j({\mathrm{\theta }}_i-b_j)))$ , that is, $P_{ju}({\mathrm{\theta }}_i)=\exp (uD{a}_j({\mathrm{\theta }}_i-b_j))/(1+\exp (D{a}_j({\mathrm{\theta }}_i-b_j))).$ Here, $D$ is a constant, $a_j$ is the discrimination parameter, and $b_j$ is the difficulty parameter. The JSD of dual-objective CD-CAT was defined as mutual information between the two discrete random variables $U_{ij}$ and $Z$ , where $U_{ij}$ has a mixture distribution between $P_{ju}(\mathrm{\alpha })$ and $P_{ju}(\mathrm{\theta })$ , and $Z$ is the binary indicator variable for each distribution. For detailed information about relationship between the JSD, KL information, and Fisher information, please refer to Kang et al. (2017).

Relationship Between the SHE and the JSD

The purpose of this section is to establish the statement that the SHE and the JSD as two item selection criteria in CD-CAT are linearly related. Because the JSD itself is defined by the SHE, we apply the well-known relationship between the mutual information (or JSD) and SHE to establish a relationship between the item selection criteria that are developed using these two measures. The mutual information and SHE satisfy two well-known equations 2.43 and 2.44 from Theorem 2.4.1 in Cover and Thomas (2006, p. 21); that is, $I(X;Y)=H(X)-H(X|Y)$ and $I(X;Y)=H(Y)-H(Y|X)$ , where $I(X;Y)$ and $H(X|Y)$ are respectively mutual information and conditional entropy for two random variables $X$ and $Y$ . Let $X=U_{ij}$ and $Y={\mathrm{\alpha }}_c^{(t)}$ , with probability distributions $P(U_{ij}=u)$ and π _i,t .  As $JS{D}_{ij}=I(U_{ij};{\mathrm{\alpha }}_c^{(t)})$ was proved in Yigit et al. (2018), we have $JS{D}_{ij}=I(U_{ij};{\mathrm{\alpha }}_c^{(t)})=H({\mathrm{\alpha }}_c^{(t)})-H({\mathrm{\alpha }}_c^{(t)}|U_{ij})$ , which follows directly from the second well-known equation. As shown in the “SHE Procedure” section, $SH{E}_{ij}$ can be written as the conditional entropy $H({\mathrm{\alpha }}_c^{(t)}|U_{ij})$ . Thus, we have $JS{D}_{ij}=H({\mathrm{\pi }}_{i,t})-SH{E}_{ij}$ .

Next, we will provide an alternative way to prove the above statement, which would be useful for a better understanding of the relation. For simplicity, let the denominators or the normalizing constants of Equations 2 and 4 be $C_1={\sum }_{c=1}^{2^K}{\mathrm{\pi }}_0({\mathrm{\alpha }}_c)L({\mathbf{u}}_i^{(t)}|{\mathrm{\alpha }}_c)$ and $C_2={\sum }_{c=1}^{2^K}{\mathrm{\pi }}_{i,t}({\mathrm{\alpha }}_c)P_{ju}({\mathrm{\alpha }}_c).$ Note that the right-hand side of $C_2$ is relevant to $u$ . The detailed mathematical steps are described below. Substituting Equations 4 and 5 into Equation 6, the $SH{E}_{ij}$ can be written in the following equivalent form

$$SH{E}_{ij}=\sum _{u=0}^1\left[\sum _{c=1}^{2^K}{\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_c\right)P_{ju}\left({\mathrm{\alpha }}_c\right)\right]H\left(\frac{{\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_c\right)P_{ju}\left({\mathrm{\alpha }}_c\right)}{C_2}\right).$$

(10)

By the definition of SHE, Equation 10 can be computed by

$$\begin{array}{l}SH{E}_{ij}=\sum _{u=0}^1\left[\sum _{c=1}^{2^K}{\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_c\right)P_{ju}\left({\mathrm{\alpha }}_c\right)\right]\\ \left[-\sum _{c=1}^{2^K}\frac{{\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_c\right)P_{ju}\left({\mathrm{\alpha }}_c\right)}{C_2}\log \frac{{\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_c\right)P_{ju}\left({\mathrm{\alpha }}_c\right)}{C_2}\right]\end{array}$$

(11)

Recall from two basic logarithmic properties that the log of a quotient is equal to the difference between the logs of the numerator and denominator, and the log of a product is equal to the sum of the logs of the factors. Equation 11 can be written as

$$\begin{array}{l}SH{E}_{ij}=\sum _{u=0}^1\left[\sum _{c=1}^{2^K}{\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_c\right)P_{ju}\left({\mathrm{\alpha }}_c\right)\right]\\ \left[-\sum _{c=1}^{2^K}\frac{{\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_c\right)P_{ju}\left({\mathrm{\alpha }}_c\right)}{C_2}\left(\log {\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_c\right)+\log P_{ju}\left({\mathrm{\alpha }}_c\right)-\log C_2\right)\right].\end{array}$$

(12)

Notice $C_2$ and $\log C_2$ can be factored out from the third summation, as they remain constant over the summation index $c$ from 1 to $2^K$ . Hence, Equation 12 has the form

$$\begin{array}{l}SH{E}_{ij}=\sum _{u=0}^1\left[-\sum _{c=1}^{2^K}\left({\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_c\right)P_{ju}\left({\mathrm{\alpha }}_c\right)\left(\log {\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_c\right)+\log P_{ju}\left({\mathrm{\alpha }}_c\right)\right)\right)\right]\\ +\sum _{u=0}^1{C}_2\log C_2,\end{array}$$

(13)

since $C_2={\sum }_{c=1}^{2^K}{\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_c\right)P_{ju}\left({\mathrm{\alpha }}_c\right)$ .

After changing the order of the summation and factoring two constant terms (i.e., ${\mathrm{\pi }}_{i,t}({\mathrm{\alpha }}_c)\log {\mathrm{\pi }}_{i,t}({\mathrm{\alpha }}_c)$ and ${\mathrm{\pi }}_{i,t}({\mathrm{\alpha }}_c)$ ) out from the new second summation, the first term on the right-hand side of the Equation 13 can be written as in the following equivalent form:

$$\begin{array}{l}-\sum _{c=1}^{2^K}\left[{\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_c\right)\log {\mathrm{\pi }}_{i,t}({\mathrm{\alpha }}_c)\sum _{u=0}^1{P}_{ju}\left({\mathrm{\alpha }}_c\right)\right]\\ -\sum _{c=1}^{2^K}\left[{\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_c\right)\left[\sum _{u=0}^1{P}_{ju}\left({\mathrm{\alpha }}_c\right)\log P_{ju}\left({\mathrm{\alpha }}_c\right)\right]\right]\\ =-\sum _{c=1}^{2^K}\left[{\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_c\right)\log {\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_c\right)\right]+\sum _{c=1}^{2^K}{\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_c\right)H\left(P_{ju}\left({\mathrm{\alpha }}_c\right)\right),\end{array}$$

(14)

which follows from ${\sum }_{u=0}^1{P}_{ju}({\mathrm{\alpha }}_c)=1$ and Equation 9.

Based on Equations 3, 13, and 14, the $SH{E}_{ij}$ can be written as

$$SH{E}_{ij}=H\left({\mathrm{\pi }}_{i,t}\right)+\sum _{c=1}^{2^K}{\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_c\right)H\left(P_{ju}\left({\mathrm{\alpha }}_c\right)\right)+\sum _{u=0}^1{C}_2\log C_2.$$

(15)

From Equation 8, the third term on the right-hand side of Equation 15 is equal to $-H(P(U_{ij}=u|{\mathbf{u}}_i^{\left(t\right)}))$ , since $C_2={\sum }_{c=1}^{2^K}{\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_c\right)P_{ju}({\mathrm{\alpha }}_c).$ Then based on Equations 7 and 15, the $SH{E}_{ij}$ can be written as

$$SH{E}_{ij}=H\left({\mathrm{\pi }}_{i,t}\right)-JS{D}_{ij},$$

(16)

which can be rewritten as

$$JS{D}_{ij}=H\left({\mathrm{\pi }}_{i,t}\right)-SH{E}_{ij}.$$

(17)

The meaning of Equation 17 is consistent with the fact that the JSD or mutual information is a special case of a more general quantity called relative entropy. As H(π _i,t ) is not a function of both item parameters and item responses of the candidate item j, it is a constant for examinee i. Thus, minimizing $SH{E}_{ij}$ is equivalent to maximizing $JS{D}_{ij}$ because they select the same item for administration at the $(t+1)$ th stage of testing. So far, this completes the proof that the SHE and the JSD have a linear relationship under the G-DINA model. Note that two proofs of the relationship between the SHE and JSD just rely on the form of an item response function for a binary response variable and do not depend on any particular CDM, because the item response function $P_{ju}({\mathrm{\alpha }}_i),$ the prior distribution ${\mathrm{\pi }}_0({\mathrm{\alpha }}_c)$ , and the current item response vector ${\mathbf{u}}_i^{(t)}$ are all we need to calculate SHE and mutual information.

Tables A1 and A2 in the appendix are presented for the illustration of computation of values of indices for the SHE and JSD. Here, the SHE and JSD are computed for two items with different item response distributions or different item parameters, where a discrete uniform prior distribution for attribute patterns was used. From these two tables, the relationship between the SHE and JSD for the two items satisfied Equation 16 or Equation 17, and minimizing $SH{E}_{ij}$ is equivalent to maximizing $JS{D}_{ij}$ . Empirical examples show that the two item selection criteria are expected to behave similarly in CD-CAT.

Simulation Study

Design

A small-scale simulation study was conducted to compare the performance of the SHE and JSD. Following a design similar to that in Cheng (2009) and Xu et al. (2016), the DINA model and five independent attributes were considered in the simulation study. For the generation of four item banks, a Q-matrix for 300 items should be first simulated. The entries of the Q-matrix were generated item by item and attribute by attribute. Each item has 20% chance of measuring each attribute. Four item banks were considered: (a) slipping and guessing parameters were fixed as one of the three levels, such as 0.05, 0.1, or 0.2, and (b) both slipping and guessing parameters were randomly draw from a uniform distribution on the interval [0.1, 0.3]. Test length was either fixed at 5 or 10 items. The sample size of examinees was set to 2,000. Attribute patterns for all examinees were randomly drawn from all possible attribute patterns with equal probability. Details of simulation design are presented in Table A3 in the appendix.

To consider the impact of the simulation of item responses in CD-CAT on the performance of the SHE and JSD, two types of CAT simulation were considered: full simulations or post hoc simulations (Magis et al., 2017). In case of a full CAT simulation, an item response for examinee $i$ on item $j$ was randomly drawn from a Bernoulli distribution, denoted by $\mathrm{Bernoulli}(P_{j1}({\mathrm{\alpha }}_i))$ . Full CAT simulations imply that item responses for examinee $i$ on the same set of items may be different. Under the post hoc simulation scenario, a complete item response matrix was created first for all examinees on each item bank before CD-CAT administrations and the responses to the selected items for the SHE or JSD were drawn from the complete item response matrix. First of all, post hoc simulations were considered to make use of exactly the same item responses for two item selection methods (SHE and JSD) under each item bank in CD-CAT. We replicated each type of simulation process 100 times under each condition and recorded final estimates of attribute patterns for all examinees.

Results

The attribute-level recovery rate is defined as the proportion of each attribute that is correctly identified. The pattern recovery rate is defined as the proportion of entire attribute pattern that is correctly recovered. Mean and standard deviation of attribute-level and pattern recovery rates for each level of item parameters are shown in Tables 1–4. For the SHE, our results are consistent with the results of Xu et al. (2016). Consistent with our theoretical conclusions, the SHE and JSD behaved quite similarly, because their attribute-level and pattern recovery rates were very close to each other under all conditions.

Table 1.

Mean and Standard Deviation (in brackets) of Attribute and Pattern Recovery Rate for Slipping and Guessing Parameters of 0.05.

			Attribute					Pattern
Simulations	Test length	Method	1	2	3	4	5
Post hoc	5	SHE	0.950 (0.008)	0.950 (0.007)	0.950 (0.008)	0.950 (0.008)	0.950 (0.008)	0.774 (0.011)
		JSD	0.950 (0.008)	0.950 (0.007)	0.950 (0.008)	0.950 (0.008)	0.950 (0.008)	0.774 (0.011)
	10	SHE	0.985 (0.005)	0.987 (0.006)	0.988 (0.005)	0.989 (0.006)	0.986 (0.007)	0.941 (0.009)
		JSD	0.984 (0.005)	0.990 (0.006)	0.987 (0.005)	0.989 (0.006)	0.986 (0.007)	0.942 (0.009)
Full	5	SHE	0.950 (0.008)	0.951 (0.007)	0.950 (0.008)	0.951 (0.007)	0.951 (0.008)	0.775 (0.012)
		JSD	0.951 (0.007)	0.950 (0.007)	0.950 (0.008)	0.950 (0.007)	0.950 (0.009)	0.773 (0.009)
	10	SHE	0.985 (0.005)	0.987 (0.006)	0.988 (0.006)	0.989 (0.006)	0.986 (0.007)	0.942 (0.009)
		JSD	0.984 (0.005)	0.989 (0.005)	0.987 (0.005)	0.989 (0.005)	0.986 (0.007)	0.943 (0.011)

Note. SHE = Shannon entropy; JSD = Jensen–Shannon divergence.

Table 2.

Mean and Standard Deviation (in brackets) of Attribute and Pattern Recovery Rate for Slipping and Guessing Parameters of 0.1.

			Attribute					Pattern
Simulations	Test length	Method	1	2	3	4	5
Post hoc	5	SHE	0.901 (0.008)	0.900 (0.007)	0.898 (0.008)	0.902 (0.008)	0.898 (0.008)	0.589 (0.011)
		JSD	0.901 (0.008)	0.900 (0.007)	0.898 (0.008)	0.902 (0.008)	0.898 (0.008)	0.589 (0.011)
	10	SHE	0.951 (0.005)	0.955 (0.006)	0.954 (0.005)	0.963 (0.006)	0.952 (0.007)	0.816 (0.009)
		JSD	0.949 (0.005)	0.955 (0.006)	0.952 (0.005)	0.962 (0.006)	0.955 (0.007)	0.814 (0.009)
Full	5	SHE	0.897 (0.008)	0.901 (0.007)	0.898 (0.008)	0.902 (0.007)	0.900 (0.008)	0.591 (0.012)
		JSD	0.899 (0.007)	0.900 (0.007)	0.900 (0.008)	0.898 (0.007)	0.898 (0.009)	0.587 (0.009)
	10	SHE	0.950 (0.005)	0.955 (0.006)	0.954 (0.006)	0.962 (0.006)	0.954 (0.007)	0.815 (0.009)
		JSD	0.947 (0.005)	0.958 (0.005)	0.952 (0.005)	0.961 (0.005)	0.957 (0.007)	0.816 (0.011)

Note. SHE = Shannon entropy; JSD = Jensen–Shannon divergence.

Table 3.

Mean and Standard Deviation (in brackets) of Attribute and Pattern Recovery Rate for Slipping and Guessing Parameters of 0.2.

			Attribute					Pattern
Simulations	Test length	Method	1	2	3	4	5
Post hoc	5	SHE	0.800 (0.008)	0.807 (0.007)	0.800 (0.008)	0.797 (0.008)	0.799 (0.008)	0.329 (0.011)
		JSD	0.800 (0.008)	0.807 (0.007)	0.800 (0.008)	0.797 (0.008)	0.799 (0.008)	0.329 (0.011)
	10	SHE	0.845 (0.005)	0.870 (0.006)	0.854 (0.005)	0.871 (0.006)	0.853 (0.007)	0.508 (0.009)
		JSD	0.847 (0.005)	0.870 (0.006)	0.851 (0.005)	0.868 (0.006)	0.855 (0.007)	0.509 (0.009)
Full	5	SHE	0.801 (0.008)	0.802 (0.007)	0.803 (0.008)	0.799 (0.007)	0.800 (0.008)	0.330 (0.012)
		JSD	0.801 (0.007)	0.801 (0.007)	0.797 (0.008)	0.798 (0.007)	0.803 (0.009)	0.329 (0.009)
	10	SHE	0.844 (0.005)	0.865 (0.006)	0.850 (0.006)	0.873 (0.006)	0.855 (0.007)	0.505 (0.009)
		JSD	0.850 (0.005)	0.865 (0.005)	0.847 (0.005)	0.867 (0.005)	0.853 (0.007)	0.504 (0.011)

Note. SHE = Shannon entropy; JSD = Jensen–Shannon divergence.

Table 4.

Mean and Standard Deviation (in brackets) of Attribute and Pattern Recovery Rate for Slipping and Guessing Parameters of U(0.1, 0.3).

			Attribute					Pattern
Simulations	Test length	Method	1	2	3	4	5
Post hoc	5	SHE	0.884 (0.008)	0.882 (0.007)	0.848 (0.008)	0.897 (0.008)	0.838 (0.008)	0.530 (0.011)
		JSD	0.884 (0.008)	0.882 (0.007)	0.848 (0.008)	0.897 (0.008)	0.838 (0.008)	0.530 (0.011)
	10	SHE	0.953 (0.005)	0.946 (0.006)	0.939 (0.005)	0.937 (0.006)	0.913 (0.007)	0.747 (0.009)
		JSD	0.953 (0.005)	0.946 (0.006)	0.939 (0.005)	0.937 (0.006)	0.913 (0.007)	0.747 (0.009)
Full	5	SHE	0.884 (0.008)	0.882 (0.007)	0.846 (0.008)	0.898 (0.007)	0.838 (0.008)	0.529 (0.012)
		JSD	0.884 (0.007)	0.880 (0.007)	0.846 (0.008)	0.898 (0.007)	0.838 (0.009)	0.529 (0.009)
	10	SHE	0.953 (0.005)	0.946 (0.006)	0.939 (0.006)	0.938 (0.006)	0.914 (0.007)	0.747 (0.009)
		JSD	0.953 (0.005)	0.946 (0.005)	0.940 (0.005)	0.938 (0.005)	0.915 (0.007)	0.749 (0.011)

Note. SHE = Shannon entropy; JSD = Jensen–Shannon divergence.

Figure 1 presents pattern recovery rates for different test lengths and simulation types under slipping and guessing parameters of U(0.1, 0.3). From the two top panels of Figure 1, it can be observed that pattern recovery rates obtained by the SHE and JSD are the same for each replication under post hoc simulations. While for the full simulations, pattern recovery rates for the SHE and JSD were different for each replication because different item responses had an impact on test item selection. When the test length was 5, 43% pattern recovery rates of the SHE were higher than the mean of pattern recovery rates of the JSD, and 51% pattern recovery rates of the JSD were higher than the mean of pattern recovery rates of the SHE. The percentages became 49% and 60%, respectively, when the test length was 10. This result is consistent with the previous finding: “The mutual information item selection algorithm generates nearly the most accurate attribute pattern recovery in more than half of the conditions” (Wang, 2013, p. 1030).

Figure 1.

Pattern recovery rate for different test lengths and simulation types under slipping and guessing parameters of U(0.1, 0.3).

We also checked whether two item selection algorithms selected the same set of items for each examinee under post hoc simulations. For the first three item banks, two item selection algorithms based on the SHE and JSD indeed selected the same set of items but with slightly different orders. Because all test items in these item banks have the same values of item parameters, some items presented in different positions have the same value of SHE or JSD. For example, two items with same item parameters but a single distinct attribute may have the same value of SHE or JSD. For the fourth item bank, we found that two item selection algorithms based on the SHE and JSD selected the same set of items.

Discussion

In this study, we complete the proof that the SHE procedure and the JSD are linearly related under CDMs. In other words, we showed that minimizing JSD and maximizing SHE can be used interchangeably because they will select the same items in CD-CAT. The two measures are linearly related but they are not equal, meaning that two measures have the form $JS{D}_{ij}=H({\mathrm{\pi }}_{i,t})-SH{E}_{ij}$ . Although they are not equal, item selection methods based on the SHE and JSD will randomly select one of test items with the same value of the SHE or JSD index for administration at the next stage of testing, because H(π _i,t ) is a constant for examinee $i$ and minimizing $SH{E}_{ij}$ is equivalent to maximizing $JS{D}_{ij}$ at the current stage of testing.

This study is not without limitations. Theoretically, SHE, KL information, and mutual information are three ways to measure the uncertainty, and they are related to each other. It would be interesting to further investigate relationships of item selection indices based on the KL information, the SHE, the JSD, and other indices under general dichotomous or polytomous CDMs. For example, the GDI and MPWKL might be related, because they perform similarly and better than the PWKL in terms of correct attribute classification rates or test lengths. We believe GDI is simply a weighted variance of the probabilities of success of an item associated with attribute patterns given an attribute pattern distribution, and therefore we can start with comparing the weighted KL with the weighted variance to show a relationship. The GDI is defined as follows (Kaplan et al., 2015):

$${\mathrm{\zeta }}_{ij}^2=\sum _{c=1}^{2^K}{\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_c\right){\left[P_{j1}\left({\mathrm{\alpha }}_c\right)-{\overline{P}}_{ij}\right]}^2,$$

(18)

where ${\overline{P}}_{ij}={\sum }_{c=1}^{2^K}{\mathrm{\pi }}_{i,t}({\mathrm{\alpha }}_c)P_{j1}({\mathrm{\alpha }}_c)$ . The MPWKL is defined as follows (Kaplan et al., 2015):

$$\begin{array}{l}MPWK{L}_{ij}=\\ \sum _{d=1}^{2^K}\left[\sum _{c=1}^{2^K}\left[\sum _{u=0}^1\left(\log \frac{P_{ju}\left({\mathrm{\alpha }}_d\right)}{P_{ju}\left({\mathrm{\alpha }}_c\right)}\right)P_{ju}\left({\mathrm{\alpha }}_d\right){\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_c\right)\right]{\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_d\right)\right].\end{array}$$

(19)

The following algebraic procedures will simplify the calculations in Equation 19 above

$$\begin{array}{l}MPWK{L}_{ij}=\\ \sum _{d=1}^{2^K}\sum _{c=1}^{2^K}\sum _{u=0}^1\left(\log P_{ju}\left({\mathrm{\alpha }}_d\right)-\log P_{ju}\left({\mathrm{\alpha }}_c\right)\right)P_{ju}\left({\mathrm{\alpha }}_d\right){\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_c\right){\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_d\right)\end{array}$$

(20)

$$\begin{array}{l}=\sum _{d=1}^{2^K}\sum _{c=1}^{2^K}\sum _{u=0}^1{P}_{ju}\left({\mathrm{\alpha }}_d\right){\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_c\right){\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_d\right)\log P_{ju}\left({\mathrm{\alpha }}_d\right)\\ -\sum _{d=1}^{2^K}\sum _{c=1}^{2^K}\sum _{u=0}^1{P}_{ju}\left({\mathrm{\alpha }}_d\right){\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_c\right){\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_d\right)\log P_{ju}\left({\mathrm{\alpha }}_c\right)\end{array}$$

(21)

$$\begin{array}{l}=\sum _{d=1}^{2^K}\sum _{u=0}^1{\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_d\right)P_{ju}\left({\mathrm{\alpha }}_d\right)\log P_{ju}\left({\mathrm{\alpha }}_d\right)\\ -\sum _{c=1}^{2^K}\sum _{u=1}^1\sum _{d=0}^{2^K}{P}_{ju}\left({\mathrm{\alpha }}_d\right){\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_d\right){\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_c\right)\log P_{ju}\left({\mathrm{\alpha }}_c\right)\end{array}$$

(22)

$$\begin{array}{l}=\sum _{c=1}^{2^K}\sum _{u=0}^1{\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_c\right)P_{ju}\left({\mathrm{\alpha }}_c\right)\log P_{ju}\left({\mathrm{\alpha }}_c\right)\\ -\sum _{c=1}^{2^K}\sum _{u=0}^1\left[{\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_c\right)\log P_{ju}\left({\mathrm{\alpha }}_c\right)\left(\sum _{d=1}^{2^K}{P}_{ju}\left({\mathrm{\alpha }}_d\right){\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_d\right)\right)\right]\end{array}$$

(23)

$$=\sum _{c=1}^{2^K}{\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_c\right)\sum _{u=0}^1\left[P_{ju}\left({\mathrm{\alpha }}_c\right)-\sum _{d=1}^{2^K}{P}_{ju}\left({\mathrm{\alpha }}_d\right){\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_d\right)\right]\log P_{ju}\left({\mathrm{\alpha }}_c\right)$$

(24)

$$=\sum _{c=1}^{2^K}{\mathrm{\pi }}_{i,t}\left({\mathrm{\alpha }}_c\right)\left[P_{j1}\left({\mathrm{\alpha }}_c\right)-{\overline{P}}_{ij}\right]\left[\log P_{j1}\left({\mathrm{\alpha }}_c\right)-\log \left(1-P_{j1}\left({\mathrm{\alpha }}_c\right)\right)\right],$$

(25)

where Equation 20 follows from the quotient rule of logarithmic properties and Equation 25 follows directly from the complement rule in probability, as expressed by the equation $P_{j0}({\mathrm{\alpha }}_c)=1-P_{j1}({\mathrm{\alpha }}_c)$ . An easy way to calculate the MPWKL is provided by Equation 25. From Equations 18 and 25, both the GDI and MPWKL are a function of ${\mathrm{\pi }}_{i,t}({\mathrm{\alpha }}_c)(P_{j1}({\mathrm{\alpha }}_c)-{\overline{P}}_{ij}),$ but with different weights $\log P_{j1}({\mathrm{\alpha }}_c)-\log (1-P_{j1}({\mathrm{\alpha }}_c))$ and $P_{ju}({\mathrm{\alpha }}_c)-{\overline{P}}_{ij}$ . Thus, we know that the GDI is closely related to the MPWKL.

The findings of this study may contribute to the growing literature on formative assessments. First, theoretical derivations and empirical examples have shown that both indices (SHE and JSD) are expected to select the same next item given item response pattern of the same set of previous test items in CD-CAT. Consistent with our theoretical conclusions, simulation results have shown that the SHE and JSD behaved quite similarly in terms of attribute-level and pattern recovery rates. This finding can possibly be useful to help practitioners to choose an effective item selection algorithm (SHE or JSD) in the development and application of CD-CAT system in the field of educational and psychological measurement. Second, the effectiveness of item selection algorithm in CD-CAT will impact the quality of curriculum delivery and the outcomes of learning. If individual diagnosis results with a high measurement precision can be provided by using an effective item selection algorithm of CD-CAT, then diverse instructional materials can cater to the diverse needs or specific knowledge status of all learners (Lashley, 2019). Finally, information-based indices are now not only widely applied in CD-CAT, but also useful for any test construction stage where test items are selected based on their statistical characteristics (e.g., Henson & Douglas, 2005; Henson et al., 2008; Kuo et al., 2016). For example, the cognitive diagnostic index, the attribute-level discrimination index, and their modified indices as KL information based measures have been used for the construction of diagnostic tests. Future research on automated test assembly for cognitive diagnosis will expand the scope of the application of the current finding.