Marginal discriminant projections: An adaptable margin discriminant approach to feature reduction and extraction

For pattern analysis and recognition, it is necessary to find the meaningful low-dimensional representation of data in general. In the past decades, subspace learning methods have been regarded as the useful tools for feature extraction and dimensionality reduction. Without loss of generality, the linear subspace learning algorithms can be explained as the enhancement of the affinity and repulsion of several data pairs. Based on this point of view, a novel linear discriminant method, termed Marginal Discriminant Projections (MDP), is proposed to learn the marginal subspace. Rather than the existing marginal learning method, the maladjusted learning problem is alleviated by adopting a hierarchical fuzzy clustering approach, where the discriminative margin can be found adaptively and the iterative objective optimization is avoided. In addition, the proposed method is immune from the well-known curse of dimensionality problem, with respect to the presented subspace learning framework. Experiments on extensive datasets demonstrate the effectiveness of the proposed MDP for discriminative learning and recognition tasks.