The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Robust principal component analysis by self-organizing rules based on statistical physics approach
Abstract
This paper applies statistical physics to the problem of robust principal component analysis (PCA). The commonly used PCA learning rules are first related to energy functions. These functions are generalized by adding a binary decision field with a given prior distribution so that outliers in the data are dealt with explicitly in order to make PCA robust. Each of the generalized energy functions is then used to define a Gibbs distribution from which a marginal distribution is obtained by summing over the binary decision field. The marginal distribution defines an effective energy function, from which self-organizing rules have been developed for robust PCA. Under the presence of outliers, both the standard PCA methods and the existing self-organizing PCA rules studied in the literature of neural networks perform quite poorly. By contrast, the robust rules proposed here resist outliers well and perform excellently for fulfilling various PCA-like tasks such as obtaining the first principal component vector, the first k principal component vectors, and directly finding the subspace spanned by the first k vector principal component vectors without solving for each vector individually. Comparative experiments have been made, and the results show that the authors' robust rules improve the performances of the existing PCA algorithms significantly when outliers are present.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Huber, P. J. (1981) · Wiley Series in Probability and Statistics · doi:10.1002/0471725250 · Cited by 7,066
Simplified neuron model as a principal component analyzer
Oja, E. (1982) · Journal of Mathematical Biology · doi:10.1007/bf00275687 · Cited by 2,309
Neural networks and principal component analysis: Learning from examples without local minima
Baldi, P., & Hornik, K. (1989) · Neural Networks · doi:10.1016/0893-6080(89)90014-2 · Cited by 1,383
A robust principal component analysis
Ruymgaart, F. H. (1981) · Journal of Multivariate Analysis · doi:10.1016/0047-259x(81)90091-9 · Cited by 48
Cited by
A Framework for Robust Subspace Learning
De la Torre, F., & Black, M. J. (2003) · International Journal of Computer Vision · doi:10.1023/a:1023709501986 · Cited by 604
Robust Point Matching via Vector Field Consensus
Ma, J., Zhao, J., Tian, J., Yuille, A. L., & Tu, Z. (2014) · IEEE Transactions on Image Processing · doi:10.1109/tip.2014.2307478 · Cited by 566
Self-citationRobust PCA via Outlier Pursuit
Xu, H., Caramanis, C., & Sanghavi, S. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2173156 · Cited by 445
Forecasting daily stock market return using dimensionality reduction
Zhong, X., & Enke, D. (2017) · Expert Systems with Applications · doi:10.1016/j.eswa.2016.09.027 · Cited by 394
Robust principal component analysis for computer vision
De la Torre, F., & Black, M. J. (2002) · Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001 · doi:10.1109/iccv.2001.937541 · Cited by 387
Metadata
- Authors
- Xu, L., & Yuille, A. L.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 1995
- Volume
- 6
- Issue
- 1
- Pages
- 131-143
- ISSN
- 1045-9227 (ISSN-L)
- OpenAlex
- W2098884960
- Cited by
- 215
- References
- 4
- FWCI
- 4.79
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Robust principal component analysis by self-organizing rules based on statistical physics approach. https://app.cochat.ai/papers/10.1109/72.363442
- The paper
- Xu, L., & Yuille, A. L. (1995). Robust principal component analysis by self-organizing rules based on statistical physics approach. IEEE Transactions on Neural Networks. https://doi.org/10.1109/72.363442
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.