Adaptive graph construction using data self-representativeness for pattern classification

DOI10.1016/j.ins.2015.07.005zbMath1390.68522OpenAlexW796576774MaRDI QIDQ1750336

A. Bosaghzadeh, F. Dornaika

Publication date: 18 May 2018

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2015.07.005

zbMATH Keywords

face recognitionsparse codinggraph constructiongraph-based label propagationholistic object classificationlocality-constrained linear coding

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Machine vision and scene understanding (68T45)

Related Items (4)

Near-rings on digital Hopf groups ⋮ Digital H-spaces and actions in the pointed digital homotopy category ⋮ Learning a discriminant graph-based embedding with feature selection for image categorization ⋮ Efficient dynamic graph construction for inductive semi-supervised learning

Uses Software

• Yall1

Cites Work

• Unnamed Item
• An incremental learning algorithm based on the \( K\)-associated graph for non-stationary data classification
• Graph-based semi-supervised learning by mixed label propagation with a soft constraint
• Graph-based classification of multiple observation sets
• Beyond sparsity: the role of \(L_{1}\)-optimizer in pattern classification
• Graph optimization for dimensionality reduction with sparsity constraints
• Graph-optimized locality preserving projections
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
• 10.1162/153244303322753616
• Learning with $\ell ^{1}$-graph for image analysis
• Flexible Manifold Embedding: A Framework for Semi-Supervised and Unsupervised Dimension Reduction
• Signal Recovery by Proximal Forward-Backward Splitting

This page was built for publication: Adaptive graph construction using data self-representativeness for pattern classification