Flexible non-greedy discriminant subspace feature extraction (Q2183679): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q91825139, #quickstatements; #temporary_batch_1711055989931
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Laplacian Eigenmaps for Dimensionality Reduction and Data Representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust L1-norm two-dimensional linear discriminant analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Non-Greedy Algorithm for L1-Norm LDA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improve robustness of sparse PCA by \(L_{1}\)-norm maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4444188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: $\ell _{2,p}$ -Norm Based PCA for Image Recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Discriminant Analysis Based on L1-Norm Maximization / rank
 
Normal rank

Revision as of 18:39, 22 July 2024

scientific article
Language Label Description Also known as
English
Flexible non-greedy discriminant subspace feature extraction
scientific article

    Statements

    Flexible non-greedy discriminant subspace feature extraction (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    27 May 2020
    0 references
    \(L_1\)-norm-based non-greedy discriminant analysis
    0 references
    \(L_p\)-norm inter-class dispersion
    0 references
    intra-class dispersion
    0 references
    robust distance measurement
    0 references

    Identifiers