Solution for supervised graph embedding: A case study

  • You Q
  • Zheng N
  • Gao L
 et al. 
  • 2


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


    Citations of this article.


Recently, Graph Embedding Framework has been proposed for feature extraction. Although many algorithms can be used to extract the discriminant transformation of supervised graph embedding, it is still an open issue which algorithm is more robust. In this paper, we first review the classical algorithms which can extract the discriminant transformation of linear discriminant analysis (LDA), and then generalize these classical algorithms for computing the discriminant transformation of supervised graph embedding. Secondly, we theoretically analyze the robustness of these generalized algorithms. Finally, in order to overcome the disadvantages of these generalized algorithms, we propose an effective method, called total space solution for supervised graph embedding (TSS/SGE), to extract the robust discriminant transformation of Supervised Graph Embedding. Extensive experiments and comprehensive comparison on real-world data are performed to demonstrate the robustness of our proposed TSS/SGE. © 2008 Elsevier B.V. All rights reserved.

Author-supplied keywords

  • Discriminant transformation
  • Graph embedding
  • Null space
  • Range space
  • SSS problem

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


Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free