Improve robustness of sparse PCA by \(L_{1}\)-norm maximization (Q645882): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.patcog.2011.07.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2066576934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Direct Formulation for Sparse PCA Using Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An augmented Lagrangian approach for sparse principal component analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3096150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse principal component analysis via regularized low rank matrix approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for robust subspace learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4395494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust principal component analysis? / rank
 
Normal rank

Revision as of 15:00, 4 July 2024

scientific article
Language Label Description Also known as
English
Improve robustness of sparse PCA by \(L_{1}\)-norm maximization
scientific article

    Statements

    Improve robustness of sparse PCA by \(L_{1}\)-norm maximization (English)
    0 references
    0 references
    0 references
    0 references
    10 November 2011
    0 references
    face recognition
    0 references
    noise
    0 references
    outlier
    0 references
    principal component analysis
    0 references
    robust
    0 references
    sparsity
    0 references

    Identifiers