Double adjacency graphs-based discriminant neighborhood embedding (Q1677849): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.patcog.2014.08.025 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: MNIST / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Yale Face / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.patcog.2014.08.025 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1983557401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LPP solution schemes for use with face recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local structure based supervised feature extraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supervised optimal locality preserving projection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discriminant neighborhood embedding for classification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.PATCOG.2014.08.025 / rank
 
Normal rank

Latest revision as of 02:50, 11 December 2024

scientific article
Language Label Description Also known as
English
Double adjacency graphs-based discriminant neighborhood embedding
scientific article

    Statements

    Double adjacency graphs-based discriminant neighborhood embedding (English)
    0 references
    0 references
    0 references
    13 November 2017
    0 references
    supervised learning
    0 references
    discriminant neighborhood embedding
    0 references
    manifold learning
    0 references
    face recognition
    0 references
    double adjacency graphs
    0 references
    0 references
    0 references

    Identifiers