Principal Component Analysis versus Factor Analysis

• URL: http://arxiv.org/abs/2110.11261v1
• Date: Thu, 21 Oct 2021 16:43:00 GMT
• Title: Principal Component Analysis versus Factor Analysis
• Authors: Zenon Gniazdowski
• Abstract summary: The article discusses selected problems related to both principal component analysis (PCA) and factor analysis (FA) A new criterion for determining the number of factors and principal components is discussed. An efficient algorithm for determining the number of factors in FA, which complies with this criterion, was also proposed.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The article discusses selected problems related to both principal component analysis (PCA) and factor analysis (FA). In particular, both types of analysis were compared. A vector interpretation for both PCA and FA has also been proposed. The problem of determining the number of principal components in PCA and factors in FA was discussed in detail. A new criterion for determining the number of factors and principal components is discussed, which will allow to present most of the variance of each of the analyzed primary variables. An efficient algorithm for determining the number of factors in FA, which complies with this criterion, was also proposed. This algorithm was adapted to find the number of principal components in PCA. It was also proposed to modify the PCA algorithm using a new method of determining the number of principal components. The obtained results were discussed.

Related papers

• Quasicyclic Principal Component Analysis [22.011612303891262]
  We present quasicyclic principal component analysis (QPCA), a generalization of principal component analysis (PCA) QPCA determines an optimized basis for a dataset in terms of families of shift-orthogonal principal vectors. This is of particular interest when analyzing cyclostationary data, whose cyclic structure is not exploited by the standard PCA algorithm.
  arXiv  Detail & Related papers  (2025-02-07T20:00:36Z)
• Contrastive Factor Analysis [70.02770079785559]
  This paper introduces a novel Contrastive Factor Analysis framework. It aims to leverage factor analysis's advantageous properties within the realm of contrastive learning. To further leverage the interpretability properties of non-negative factor analysis, it is extended to a non-negative version.
  arXiv  Detail & Related papers  (2024-07-31T16:52:00Z)
• On the Correlation between Random Variables and their Principal Components [0.0]
  The article attempts to find an algebraic formula describing the correlation coefficients between random variables and the principal components representing them. It is possible to apply this formula to optimize the number of principal components in Principal Component Analysis, as well as to optimize the number of factors in Factor Analysis.
  arXiv  Detail & Related papers  (2023-10-09T20:35:38Z)
• Do algorithms and barriers for sparse principal component analysis extend to other structured settings? [9.339550283840769]
  We study a principal component analysis problem under the spiked Wishart model. We establish fundamental limits that depend on the geometry of the problem instance. We show that a natural projected power method exhibits local convergence to the statistically near-optimal neighborhood of the solution.
  arXiv  Detail & Related papers  (2023-07-25T14:30:00Z)
• Generalized Implicit Factorization Problem [29.650588509354606]
  The Implicit Factorization Problem was first introduced by May and Ritzenhofen at PKC'09. We propose a lattice-based algorithm and analyze its efficiency under certain conditions.
  arXiv  Detail & Related papers  (2023-04-18T03:50:05Z)
• Tensor PCA for Factor Models [0.0]
  A tensor factor model describes the $d$-dimensional panel as a sum of a reduced rank component and an idiosyncratic noise. We show that for a strong factor model, a simple tensor principal component analysis algorithm is optimal for estimating factors and loadings.
  arXiv  Detail & Related papers  (2022-12-26T01:47:06Z)
• End-to-end resource analysis for quantum interior point methods and portfolio optimization [63.4863637315163]
  We provide a complete quantum circuit-level description of the algorithm from problem input to problem output. We report the number of logical qubits and the quantity/depth of non-Clifford T-gates needed to run the algorithm.
  arXiv  Detail & Related papers  (2022-11-22T18:54:48Z)
• Distributed Robust Principal Analysis [0.0]
  We study the robust principal component analysis problem in a distributed setting. We propose the first distributed robust principal analysis algorithm based on consensus factorization, dubbed DCF-PCA.
  arXiv  Detail & Related papers  (2022-07-24T05:45:07Z)
• Shared Independent Component Analysis for Multi-Subject Neuroimaging [107.29179765643042]
  We introduce Shared Independent Component Analysis (ShICA) that models each view as a linear transform of shared independent components contaminated by additive Gaussian noise. We show that this model is identifiable if the components are either non-Gaussian or have enough diversity in noise variances. We provide empirical evidence on fMRI and MEG datasets that ShICA yields more accurate estimation of the components than alternatives.
  arXiv  Detail & Related papers  (2021-10-26T08:54:41Z)
• Variance Minimization in the Wasserstein Space for Invariant Causal Prediction [72.13445677280792]
  In this work, we show that the approach taken in ICP may be reformulated as a series of nonparametric tests that scales linearly in the number of predictors. Each of these tests relies on the minimization of a novel loss function that is derived from tools in optimal transport theory. We prove under mild assumptions that our method is able to recover the set of identifiable direct causes, and we demonstrate in our experiments that it is competitive with other benchmark causal discovery algorithms.
  arXiv  Detail & Related papers  (2021-10-13T22:30:47Z)
• Eigen Analysis of Self-Attention and its Reconstruction from Partial Computation [58.80806716024701]
  We study the global structure of attention scores computed using dot-product based self-attention. We find that most of the variation among attention scores lie in a low-dimensional eigenspace. We propose to compute scores only for a partial subset of token pairs, and use them to estimate scores for the remaining pairs.
  arXiv  Detail & Related papers  (2021-06-16T14:38:42Z)
• Repulsive Mixture Models of Exponential Family PCA for Clustering [127.90219303669006]
  The mixture extension of exponential family principal component analysis ( EPCA) was designed to encode much more structural information about data distribution than the traditional EPCA. The traditional mixture of local EPCAs has the problem of model redundancy, i.e., overlaps among mixing components, which may cause ambiguity for data clustering. In this paper, a repulsiveness-encouraging prior is introduced among mixing components and a diversified EPCA mixture (DEPCAM) model is developed in the Bayesian framework.
  arXiv  Detail & Related papers  (2020-04-07T04:07:29Z)
• Sparse principal component regression via singular value decomposition approach [0.0]
  Principal component regression (PCR) is a two-stage procedure. Since PCA is performed by using only explanatory variables, the principal components have no information about the response variable. We propose a one-stage procedure forPCR in terms of singular value decomposition approach.
  arXiv  Detail & Related papers  (2020-02-21T09:03:05Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.