Greedy approaches to semi-supervised subspace learning

DOI10.1016/J.PATCOG.2014.10.031MaRDI QIDQ1678697zbMATH OpenOpenAlexFDO

Authors Min-Young Kim

Publication date 20 November 2017

Published in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.patcog.2014.10.031

zbMATH Keywords

dimensionality reductionsemi-supervised learninginfinite-dim greedy search

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Learning a tensor subspace for semi-supervised dimensionality reduction
• Convergence rate of the semi-supervised greedy algorithm
• A unified framework for semi-supervised dimensionality reduction
• Semi-supervised learning with nuclear norm regularization
• Semisupervised tangent space discriminant analysis

Cites work

• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• A unified framework for semi-supervised dimensionality reduction
• Canonical Correlation Analysis: An Overview with Application to Learning Methods
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
• Large margin subspace learning for feature selection
• Manifold regularization: a geometric framework for learning from labeled and unlabeled examples
• On incremental and robust subspace learning
• Principal component analysis.

Cited in

(3)

• Subspace learning with partial information
• Hierarchical unsupervised multi-view feature selection
• Semi-Supervised Bilinear Subspace Learning

Describes a project that uses

Uses Software

• UCI

This page was built for publication: Greedy approaches to semi-supervised subspace learning

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