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), 15-22.


[img] PDF - Accepted Manuscript
Download (410Kb)


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.

Item Type: Article
ISSNs: 1433-7541
Related URLs:
Keywords: Kernel machines, Fisher discriminant analysis, majorize-minimize algorithms, sparsity, parsimony
Divisions : Faculty of Physical Sciences and Engineering > Electronics and Computer Science
ePrint ID: 266573
Accepted Date and Publication Date:
1 February 2010Published
Date Deposited: 14 Aug 2008 12:04
Last Modified: 27 Mar 2014 20:12
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/266573

Actions (login required)

View Item View Item

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