A mathematical programming approach to the kernel fisher algorithm

Sebastian Mika, Gunnar Ratsch, Klaus Robert Müller

Research output: Chapter in Book/Report/Conference proceedingConference contribution

122 Citations (Scopus)

Abstract

We investigate a new kernel-based classifier: the Kernel Fisher Discriminant (KFD). A mathematical programming formulation based on the observation that KFD maximizes the average margin permits an interesting modification of the original KFD algorithm yielding the sparse KFD. We find that both, KFD and the proposed sparse KFD, can be understood in an unifying probabilistic context. Furthermore, we show connections to Support Vector Machines and Relevance Vector Machines. From this understanding, we are able to outline an interesting kernel-regression technique based upon the KFD algorithm. Simulations support the usefulness of our approach.

Original languageEnglish
Title of host publicationAdvances in Neural Information Processing Systems 13 - Proceedings of the 2000 Conference, NIPS 2000
PublisherNeural information processing systems foundation
ISBN (Print)0262122413, 9780262122412
Publication statusPublished - 2001
Externally publishedYes
Event14th Annual Neural Information Processing Systems Conference, NIPS 2000 - Denver, CO, United States
Duration: 2000 Nov 272000 Dec 2

Publication series

NameAdvances in Neural Information Processing Systems
ISSN (Print)1049-5258

Other

Other14th Annual Neural Information Processing Systems Conference, NIPS 2000
Country/TerritoryUnited States
CityDenver, CO
Period00/11/2700/12/2

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems
  • Signal Processing

Fingerprint

Dive into the research topics of 'A mathematical programming approach to the kernel fisher algorithm'. Together they form a unique fingerprint.

Cite this