This is the authors' abstract. We don't add key points for this paper.
In this paper, we present a self-adaptive semi-supervised dimension reduction framework for image class recognition. Compared with the Semi-supervised Local Fisher Discriminant Analysis (SELF), whose classification performance is significantly influenced by some parameters – Neighbour size k of every labelled sample, Affinity Matrix A = { A ij } and Trade-off parameter β , our sparse algorithm is developed based on the distribution of the data set, which is much more adaptive to data set themselves. To develop a more tractable and practical approach, we in particular impose neighourhood structure constraint on the labelled samples in the minimum reconstruction criterion and develop a quadratic optimisation technique to approximately estimate the affine matrix used in the Local Fisher Discriminant Analysis (LFDA). We also give a novel approach to estimate the β automatically. Our experiments on semi-supervised face recognition task demonstrate that the proposed method is more robust and efficient in dealing with the semi-supervised problems in face recognition when compared with the related SELF methods.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Liu et al. (2012) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: