tag:crantastic.org,2005:/authors/7362Latest activity for Anthony Raborn2019-10-10T04:42:46Zcrantastic.orgtag:crantastic.org,2005:TimelineEvent/935692019-10-10T04:42:46Z2019-10-10T04:42:46ZShortForm was upgraded to version 0.4.4<a href="/packages/ShortForm">ShortForm</a> was <span class="action">upgraded</span> to version <a href="/packages/ShortForm/versions/88954">0.4.4</a><br /><h3>Package description:</h3><p>Performs automatic creation of short forms of scales with an ant colony optimization algorithm and a Tabu search. As implemented in the package, the ant colony algorithm randomly selects items to build a model of a specified length, then updates the probability of item selection according to the fit of the best model within each set of searches. The algorithm continues until the same items are selected by multiple ants a given number of times in a row. On the other hand, the Tabu search changes one parameter at a time to be either free, constrained, or fixed while keeping track of the changes made and putting changes that result in worse fit in a "tabu" list so that the algorithm does not revisit them for some number of searches. See Leite, Huang, & Marcoulides (2008) <doi:10.1080/00273170802285743> for an applied example of the ant colony algorithm, and Marcoulides & Falk (2018) <doi:10.1080/10705511.2017.1409074> for an applied example of the Tabu search.</p>crantastic.orgtag:crantastic.org,2005:TimelineEvent/935172019-10-09T04:40:29Z2019-10-09T04:40:29ZcaMST was upgraded to version 0.1.2<a href="/packages/caMST">caMST</a> was <span class="action">upgraded</span> to version <a href="/packages/caMST/versions/88902">0.1.2</a><br /><h3>Package description:</h3><p>Provides functions to more easily analyze computerized adaptive tests. Currently, functions for computerized adaptive tests (CAT), computer adaptive multistage tests (CMT), and mixed computer adaptive multistage tests (McaMST) utilizing CAT item-level adaptation for the initial stage and traditional MST module-level adaptation for the subsequent stages have been created, and a variation of Hybrid computer adaptive MST is planned as well. For an in-depth look at CAT and MST, see Weiss & Kingsbury (1984) <doi:10.1111/j.1745-3984.1984.tb01040.x> and Luecht & Nungester (2000) <doi:10.1007/0-306-47531-6_6> respectively.</p>crantastic.orgtag:crantastic.org,2005:TimelineEvent/915232019-08-07T18:03:05Z2019-08-07T18:03:05ZShortForm was upgraded to version 0.4.3<a href="/packages/ShortForm">ShortForm</a> was <span class="action">upgraded</span> to version <a href="/packages/ShortForm/versions/87015">0.4.3</a><br /><h3>Package description:</h3><p>Performs automatic creation of short forms of scales with an ant colony optimization algorithm and a Tabu search. As implemented in the package, the ant colony algorithm randomly selects items to build a model of a specified length, then updates the probability of item selection according to the fit of the best model within each set of searches. The algorithm continues until the same items are selected by multiple ants a given number of times in a row. On the other hand, the Tabu search changes one parameter at a time to be either free, constrained, or fixed while keeping track of the changes made and putting changes that result in worse fit in a "tabu" list so that the algorithm does not revisit them for some number of searches. See Leite, Huang, & Marcoulides (2008) <doi:10.1080/00273170802285743> for an applied example of the ant colony algorithm, and Marcoulides & Falk (2018) <doi:10.1080/10705511.2017.1409074> for an applied example of the Tabu search.</p>crantastic.orgtag:crantastic.org,2005:TimelineEvent/805432018-10-17T04:42:46Z2018-10-17T04:42:46ZShortForm was upgraded to version 0.4.2<a href="/packages/ShortForm">ShortForm</a> was <span class="action">upgraded</span> to version <a href="/packages/ShortForm/versions/76850">0.4.2</a><br /><h3>Package description:</h3><p>Performs automatic creation of short forms of scales with an ant colony optimization algorithm and a Tabu search. As implemented in the package, the ant colony algorithm randomly selects items to build a model of a specified length, then updates the probability of item selection according to the fit of the best model within each set of searches. The algorithm continues until the same items are selected by multiple ants a given number of times in a row. On the other hand, the Tabu search changes one parameter at a time to be either free, constrained, or fixed while keeping track of the changes made and putting changes that result in worse fit in a "tabu" list so that the algorithm does not revisit them for some number of searches. See Leite, Huang, & Marcoulides (2008) <doi:10.1080/00273170802285743> for an applied example of the ant colony algorithm, and Marcoulides & Falk (2018) <doi:10.1080/10705511.2017.1409074> for an applied example of the Tabu search.</p>crantastic.orgtag:crantastic.org,2005:TimelineEvent/795352018-09-16T18:20:26Z2018-09-16T18:20:26ZcaMST was released<a href="/packages/caMST">caMST</a> was <span class="action">released</span><br /><h3>Package description:</h3><p>Provides functions to more easily analyze computerized adaptive tests. Currently, functions for computerized adaptive tests (CAT), computer adaptive multistage tests (CMT), and mixed computer adaptive multistage tests (McaMST) utilizing CAT item-level adaptation for the initial stage and traditional MST module-level adaptation for the subsequent stages have been created, and a variation of Hybrid computer adaptive MST is planned as well. For an in-depth look at CAT and MST, see Weiss & Kingsbury (1984) <doi:10.1111/j.1745-3984.1984.tb01040.x> and Luecht & Nungester (2000) <doi:10.1007/0-306-47531-6_6> respectively.</p>crantastic.orgtag:crantastic.org,2005:TimelineEvent/763222018-06-13T15:22:31Z2018-06-13T15:22:31ZShortForm was upgraded to version 0.4.1<a href="/packages/ShortForm">ShortForm</a> was <span class="action">upgraded</span> to version <a href="/packages/ShortForm/versions/72827">0.4.1</a><br /><h3>Package description:</h3><p>Performs automatic creation of short forms of scales with an ant colony optimization algorithm and a Tabu search. As implemented in the package, the ant colony algorithm randomly selects items to build a model of a specified length, then updates the probability of item selection according to the fit of the best model within each set of searches. The algorithm continues until the same items are selected by multiple ants a given number of times in a row. On the other hand, the Tabu search changes one parameter at a time to be either free, constrained, or fixed while keeping track of the changes made and putting changes that result in worse fit in a "tabu" list so that the algorithm does not revisit them for some number of searches. See Leite, Huang, & Marcoulides (2008) <doi:10.1080/00273170802285743> for an applied example of the ant colony algorithm, and Marcoulides & Falk (2018) <doi:10.1080/10705511.2017.1409074> for an applied example of the Tabu search.</p>crantastic.orgtag:crantastic.org,2005:TimelineEvent/731872018-03-30T13:03:03Z2018-03-30T13:03:03ZShortForm was upgraded to version 0.4.0<a href="/packages/ShortForm">ShortForm</a> was <span class="action">upgraded</span> to version <a href="/packages/ShortForm/versions/69869">0.4.0</a><br /><h3>Package description:</h3><p>Performs automatic creation of short forms of scales with an ant colony optimization algorithm and a Tabu search. As implemented in the package, the ant colony algorithm randomly selects items to build a model of a specified length, then updates the probability of item selection according to the fit of the best model within each set of searches. The algorithm continues until the same items are selected by multiple ants a given number of times in a row. On the other hand, the Tabu search changes one parameter at a time to be either free, constrained, or fixed while keeping track of the changes made and putting changes that result in worse fit in a "tabu" list so that the algorithm does not revisit them for some number of searches. See Leite, Huang, & Marcoulides (2008) <doi:10.1080/00273170802285743> for an applied example of the ant colony algorithm, and Marcoulides & Falk (2018) <doi:10.1080/10705511.2017.1409074> for an applied example of the Tabu search.</p>crantastic.orgtag:crantastic.org,2005:TimelineEvent/675382017-10-20T09:02:29Z2017-10-20T09:02:29ZShortForm was released<a href="/packages/ShortForm">ShortForm</a> was <span class="action">released</span><br /><h3>Package description:</h3><p>Performs automatic creation of short forms of scales with an ant colony optimization algorithm and a Tabu search. As implemented in the package, the ant colony algorithm randomly selects items to build a model of a specified length, then updates the probability of item selection according to the fit of the best model within each set of searches. The algorithm continues until the same items are selected by multiple ants a given number of times in a row. On the other hand, the Tabu search changes one parameter at a time to be either free, constrained, or fixed while keeping track of the changes made and putting changes that result in worse fit in a "tabu" list so that the algorithm does not revisit them for some number of searches. See Leite, Huang, & Marcoulides (2008) <doi:10.1080/00273170802285743> for an applied example of the ant colony algorithm, and Marcoulides & Falk (2018) <doi:10.1080/10705511.2017.1409074> for an applied example of the Tabu search.</p>crantastic.org