Prime

Type your tag names separated by a space and hit enter

Stochastic search item selection for factor analytic models.

Abstract

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.

Links

  • Aggregator Full Text
  • Authors+Show Affiliations

    ,

    Department of Primary Education, University of Ioannina, Greece; Department of Hygiene and Epidemiology, University of Ioannina School of Medicine, Greece.

    Source

    MeSH

    Algorithms
    Computer Simulation
    Factor Analysis, Statistical
    Linear Models
    Markov Chains
    Models, Statistical
    Monte Carlo Method
    Personality Inventory
    Psychological Tests
    Psychometrics
    Stochastic Processes

    Pub Type(s)

    Journal Article
    Research Support, Non-U.S. Gov't

    Language

    eng

    PubMed ID

    23837882