Frontiers of Computer Science

, Volume 8, Issue 5, pp 785–792

Linear discriminant analysis with worst between-class separation and average within-class compactness

Research Article

DOI: 10.1007/s11704-014-3337-x

Cite this article as:
Yang, L. & Chen, S. Front. Comput. Sci. (2014) 8: 785. doi:10.1007/s11704-014-3337-x
  • 57 Downloads

Abstract

Linear discriminant analysis (LDA) is one of the most popular supervised dimensionality reduction (DR) techniques and obtains discriminant projections by maximizing the ratio of average-case between-class scatter to average-case within-class scatter. Two recent discriminant analysis algorithms (DAS), minimal distance maximization (MDM) and worst-case LDA (WLDA), get projections by optimizing worst-case scatters. In this paper, we develop a new LDA framework called LDA with worst between-class separation and average within-class compactness (WSAC) by maximizing the ratio of worst-case between-class scatter to average-case within-class scatter. This can be achieved by relaxing the trace ratio optimization to a distance metric learning problem. Comparative experiments demonstrate its effectiveness. In addition, DA counterparts using the local geometry of data and the kernel trick can likewise be embedded into our framework and be solved in the same way.

Keywords

dimensionality reduction linear discriminant analysis the worst separation the average compactness 

Copyright information

© Higher Education Press and Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  1. 1.College of Computer Science and TechnologyNanjing University of Aeronautics and AstronauticsNanjingChina

Personalised recommendations