The GAabbreviate uses Genetic Algorithms as an optimization tool for scale abbreviation or subset selection that maximally captures the variance in the original data.

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 |

`items` |
A matrix of subjects x item scores. |

`scales` |
A matrix of subjects x scale scores. |

`itemCost` |
The fitness cost of each item. This will usually need to be determined by trial and error. |

`maxItems` |
The maximum number of items used to score each scale. |

`maxiter` |
Number of generations of GA to run. |

`popSize` |
Size of population in each generation of the GA. |

`...` |
further arguments passed to |

`plot` |
Logical; if |

`verbose` |
Logical; by default in interactive sessions is set to |

`crossVal` |
Logical; if |

`impute` |
Logical; if |

`pairwise` |
Logical; if |

`minR` |
The minimum bivariate item-scale correlation required in order to retain an item. Note that if this is set above 0, the number of items retained can be lower than the value of |

`sWeights` |
Weighting of scales. By default, all scales will have unit weighting, but if you want to emphasize some scales more heavily, pass a vector with length equal to the number of scales. |

`nSample` |
For extremely large datasets, you may wish to use only a subset of observations to generate a measure. Passing any non-zero number will randomly select |

`seed` |
An integer value containing the random number generator state. Set this argument to make the results exactly reproducible. |

The GAabbreviate uses Genetic Algorithms (GAs) as an optimization tool for shortening a large set of variables (e.g., in a lengthy battery of questionnaires) into a shorter subset that maximally captures the variance in the original data. An exhaustive search of all possible shorter forms of the original measure would be time consuming, especially for a measure with a large number of items. For a long form of length *L* (e.g., 100 items of a self-report scale), the size of the search space is *2^L* (1.26e+30) and forms a hypercube of *L* dimensions. The GA uses hypercube sampling by sampling the corners of the *L*-dimensional hypercube. It optimizes the search by mimicking Darwinian evolution mechanisms (of selection, crossover, and mutation) while searching through a "landscape" of the collection of all possible fitness values to find an optimal value. This does not imply that the GA finds the "best" possible solution. Rather, the GA is highly efficient in quickly yielding a "good" and "robust" solution rated against a user-defined fitness criterion.

The GAabbreviate uses the GA package (Scrucca, 2013) to efficiently implement Yarkoni's (2010) scale abbreviation cost function:

*Cost = Ik + ∑_{i=1}^s w_i(1-R_i^2)*

where *I* represents a user-specified fixed item cost, *k* represents the number of items retained by the GA (in any given iteration), *s* is the number of subscales in the measure, *w_i* are the weights (by default w_i = 1 for any *i*) associated with each subscale (if there are any subsets to be retained), and *R_i^2* is the amount of variance in the ith subscale that can be explained by a linear combination of individual item scores. Adjusting the value of *I* low or high yields longer or shorter measures respectively. When the cost of each individual item retained in each generation outweighs the cost of a loss in explained variance, the GA yields a relatively brief measure. When the cost is low, the GA yields a relatively longer measure maximizing explained variance (Yarkoni, 2010).

Sahdra, Ciarrochi, Parker & Scrucca (2016) contains an example of how `GAabbreviate`

can be used for item-reduction of a multidimensional scale.

An object of class `'GAabbreviate'`

providing the following information:

`data` |
The input data. |

`settings` |
The input settings. |

`results` |
The results obtained. |

`best` |
The cost and fit of the final solution. |

`GA` |
An object of class |

`measure` |
A list of measure values. |

A `summary`

and `plot`

methods are available to inspect the results. See example section.

Luca Scrucca, Department of Economics, University of Perugia, Perugia, ITALY

Baljinder K. Sahdra, Institute for Positive Psychology and Education, Australian Catholic University, Strathfield, NSW, AUSTRALIA

Send inquiries to baljinder.sahdra@acu.edu.au.

Sahdra B. K., Ciarrochi J., Parker P. and Scrucca L. (2016). Using genetic algorithms in a large nationally representative American sample to abbreviate the Multidimensional Experiential Avoidance Questionnaire. *Frontiers in Psychology*, Volume 7(189), pp. 1–14. http://www.frontiersin.org/quantitative_psychology_and_measurement/10.3389/fpsyg.2016.00189/abstract

Scrucca, L. (2013). GA: a package for genetic algorithms in R. *Journal of Statistical Software*, 53(4), 1-37, http://www.jstatsoft.org/v53/i04/.

Yarkoni, T. (2010). The abbreviation of personality, or how to measure 200 personality scales with 200 items. *Journal of Research in Personality*, 44(2), 180-198.

ga

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 | ```
### Example using random generated data
nsubject = 100
nitems = 15
set.seed(123)
items = matrix(sample(1:5, nsubject*nitems, replace = TRUE),
nrow = nsubject, ncol = nitems)
scales = cbind(rowSums(items[,1:10]), rowSums(items[,11:15]))
GAA = GAabbreviate(items, scales, itemCost = 0.01, maxItems = 5,
popSize = 50, maxiter = 300, run = 100)
plot(GAA)
summary(GAA)
# more info can be retrieved using
GAA$best
GAA$measure
``` |

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.

All documentation is copyright its authors; we didn't write any of that.