The University of Southampton
University of Southampton Institutional Repository

A Simple Iterative Algorithm for Parsimonious Binary Kernel Fisher Discrimination

Harrison, Robert F. and Pasupa, Kitsuchart (2010) A Simple Iterative Algorithm for Parsimonious Binary Kernel Fisher Discrimination Pattern Analysis & Applications, 13, (1), pp. 15-22. (doi:10.1007/s10044-009-0162-1).

Record type: Article


By applying recent results in optimization theory variously known as optimization transfer or majorize/minimize algorithms, an algorithm for binary, kernel, Fisher discriminant analysis is introduced that makes use of a non-smooth penalty on the coefficients to provide a parsimonious solution. The problem is converted into a smooth optimization that can be solved iteratively with no greater overhead than iteratively re-weighted least-squares. The result is simple, easily programmed and is shown to perform, in terms of both accuracy and parsimony, as well as or better than a number of leading machine learning algorithms on two well-studied and substantial benchmarks.

PDF A_Simple_Iterative_Algorithm_for_Parsimonious_Binary_Kernel_Fisher_Discrimination.pdf - Accepted Manuscript
Download (420kB)

More information

Published date: 1 February 2010
Keywords: Kernel machines, Fisher discriminant analysis, majorize-minimize algorithms, sparsity, parsimony
Organisations: Electronics & Computer Science


Local EPrints ID: 266573
PURE UUID: cf30cbbc-b2eb-4b3b-87a6-b61799d061ac

Catalogue record

Date deposited: 14 Aug 2008 12:04
Last modified: 18 Jul 2017 07:15

Export record



Author: Robert F. Harrison
Author: Kitsuchart Pasupa

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton:

ePrints Soton supports OAI 2.0 with a base URL of

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.