• DocumentCode
    3445427
  • Title

    Sparse factor analysis via likelihood and ℓ1-regularization

  • Author

    Ning, Lipeng ; Georgiou, Tryphon T.

  • Author_Institution
    Univ. of Minnesota, Minneapolis, MN, USA
  • fYear
    2011
  • fDate
    12-15 Dec. 2011
  • Firstpage
    5188
  • Lastpage
    5192
  • Abstract
    In this note we consider the basic problem to identify linear relations in noise. We follow the viewpoint of factor analysis (FA) where the data is to be explained by a small number of independent factors and independent noise. Thereby an approximation of the sample covariance is sought which can be factored accordingly. An algorithm is proposed which weighs in an ℓ1-regularization term that induces sparsity of the linear model (factor) against a likelihood term that quantifies distance of the model to the sample covariance. The algorithm compares favorably against standard techniques of factor analysis. Their performance is compared first by simulation, where ground truth is available, and then on stock-market data where the proposed algorithm gives reasonable and sparser models.
  • Keywords
    approximation theory; covariance analysis; stock markets; ℓ1-regularization; covariance approximation; likelihood term; linear model sparsity; sparse factor analysis; stock market data; Algorithm design and analysis; Approximation algorithms; Loading; Noise; Power industry; Principal component analysis; Sparse matrices;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Decision and Control and European Control Conference (CDC-ECC), 2011 50th IEEE Conference on
  • Conference_Location
    Orlando, FL
  • ISSN
    0743-1546
  • Print_ISBN
    978-1-61284-800-6
  • Electronic_ISBN
    0743-1546
  • Type

    conf

  • DOI
    10.1109/CDC.2011.6161415
  • Filename
    6161415