Laplacian linear discriminant analysis

作者:

Highlights:

摘要

A novel linear discriminant criterion function is proved to be equal to Fisher's criterion function. The analysis of the function is linked to spectral decomposition of the Laplacian of a graph. Moreover, the function is maximized using two algorithms. Experimental results show the effectiveness and some specific characteristics of our algorithms.

论文关键词:Linear discriminant analysis,Laplacian eigenvalues,Spectral decomposition

论文评审过程:Received 12 May 2005, Accepted 14 June 2005, Available online 22 September 2005.

论文官网地址:https://doi.org/10.1016/j.patcog.2005.06.016