Optimally Regularised Kernel Fisher Discriminant Analysis

  • Authors:
  • Kamel Saadi;Nicola L. C. Talbot;Gavin C. Cawley

  • Affiliations:
  • University of East Anglia, Norwich, United Kingdom;University of East Anglia, Norwich, United Kingdom;University of East Anglia, Norwich, United Kingdom

  • Venue:
  • ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 2 - Volume 02
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Mika et al. [Fisher discriminant analysis with kernels] introduce a non-linear formulation of Fisher's linear discriminant, based the now familiar "kernel trick", demonstrating state-of-the-art performance on a wide range of real-world benchmark datasets.In this paper, we show that the usual regularisation parameter can be adjusted so as to minimise the leave-one-out cross-validation error with a computational complexity of only O(l^2) operations, where l is the number of training patterns, rather than the O(l^4) operations required for a naïeve implementation of the leave-one-out procedure.This procedure is then used to form a component of an efficient heirarchical model selection strategy where the regularisation parameter is optimised within the inner loop while the kernel parameter are optimised in the outer loop.