# Stochastic search item selection for factor analytic models.Br J Math Stat Psychol 2014; 67(2):284-303BJ

In this paper we implement a Markov chain Monte Carlo algorithm based on the stochastic search variable selection method of George and McCulloch (1993) for identifying promising subsets of manifest variables (items) for factor analysis models. The suggested algorithm is constructed by embedding in the usual factor analysis model a normal mixture prior for the model loadings with latent indicators used to identify not only which manifest variables should be included in the model but also how each manifest variable is associated with each factor. We further extend the suggested algorithm to allow for factor selection. We also develop a detailed procedure for the specification of the prior parameters values based on the practical significance of factor loadings using ideas from the original work of George and McCulloch (1993). A straightforward Gibbs sampler is used to simulate from the joint posterior distribution of all unknown parameters and the subset of variables with the highest posterior probability is selected. The proposed method is illustrated using real and simulated data sets.

### MeSH

### Pub Type(s)

### Language

### PubMed ID

### Citation

*The British Journal of Mathematical and Statistical Psychology,*vol. 67, no. 2, 2014, pp. 284-303.

*Br J Math Stat Psychol*. 2014;67(2):284-303.

*The British Journal of Mathematical and Statistical Psychology,*

*67*(2), pp. 284-303. doi:10.1111/bmsp.12019.

*Br J Math Stat Psychol.*2014;67(2):284-303. PubMed PMID: 23837882.