Exemplar based Laplacian Discriminant Projection

  • Zheng Z
  • Yang J
  • 3


    Mendeley users who have this article in their library.
  • 0


    Citations of this article.


A new algorithm, exemplar based Laplacian Discriminant Projection (ELDP), is proposed in this paper for supervised dimensionality reduction. ELDP aims at learning a linear transformation which is an extension of Linear Discriminant Analysis combining with clustering technique. Specifically, we define three scatter matrices using similarities based on representative exemplars which are found by Affinity Propagation Clustering. After the transformation, the considered pair-wise samples within the same exemplar subset and the same class are as close as possible, while those exemplars between-classes are as far as possible. The structural information of classes is contained in the exemplar based Laplacian matrices. Thus the discriminant projection subspace can be derived by controlling the structural evolution of Laplacian matrices. The performance on several data sets demonstrates the competence of the proposed algorithm. © 2010 Elsevier Ltd. All rights reserved.

Author-supplied keywords

  • Affinity Propagation
  • Laplacian matrix
  • Supervised learning

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Zhonglong Zheng

  • Jie Yang

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free