Comparing linear discriminant analysis and support vector machines

Ibrahim Gokcen, Jing Peng

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

31 Scopus citations

Abstract

Both Linear Discriminant Analysis and Support Vector Machines compute hyperplanes that are optimal with respect to their individual objectives. However, there can be vast differences in performance between the two techniques depending on the extent to which their respective assumptions agree with problems at hand. In this paper we compare the two techniques analytically and experimentally using a number of data sets. For analytical comparison purposes, a unified representation is developed and a metric of optimality is proposed.

Original languageEnglish
Title of host publicationAdvances in Information Systems - Second International Conference, ADVIS 2002 Izmir, Turkey, October 23-25, 2002 Proceedings
EditorsTatyana Yakhno
PublisherSpringer Verlag
Pages104-113
Number of pages10
ISBN (Print)3540000097, 9783540000099
DOIs
StatePublished - 2002
Event2nd International Conference on Advances in Information Systems, ADVIS 2002 - Izmir, Turkey
Duration: 23 Oct 200225 Oct 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2457
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other2nd International Conference on Advances in Information Systems, ADVIS 2002
Country/TerritoryTurkey
CityIzmir
Period23/10/0225/10/02

Fingerprint

Dive into the research topics of 'Comparing linear discriminant analysis and support vector machines'. Together they form a unique fingerprint.

Cite this