Adaptive graph construction using data self-representativeness for pattern classification

DOI10.1016/J.INS.2015.07.005MaRDI QIDQ1750336zbMATH OpenOpenAlexFDO

Authors F. Dornaika, A. Bosaghzadeh

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 recognitiongraph constructiongraph-based label propagationholistic object classificationlocality-constrained linear codingsparse coding

Mathematics Subject Classification ID

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

Recommendations

• Enhanced low-rank representation via sparse manifold adaption for semi-supervised learning
• Supervised neighborhood graph construction for semi-supervised classification
• Manifold adaptive kernelized low-rank representation for semisupervised image classification
• Low-rank representation with adaptive graph regularization
• Noise-robust semi-supervised learning via fast sparse coding

Cites work

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

Cited in

(6)

• Near-rings on digital Hopf groups
• Enhanced low-rank representation via sparse manifold adaption for semi-supervised learning
• 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
• Data-Adaptive Active Sampling for Efficient Graph-Cognizant Classification

Describes a project that uses

Uses Software

• Yall1

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1750336)