File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Representation of a Fisher Criterion Function in a Kernel Feature Space

Author(s)
Lee, Sang WanBien, Zeungnam
Issued Date
2010-02
DOI
10.1109/TNN.2009.2036846
URI
https://scholarworks.unist.ac.kr/handle/201301/3645
Fulltext
http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=76749135664
Citation
IEEE TRANSACTIONS ON NEURAL NETWORKS, v.21, no.2, pp.333 - 339
Abstract
In this brief, we consider kernel methods for classification (Shawe-Taylor and Cristianini, 2004) from a separability point of view and provide a representation of the Fisher criterion function in a kernel feature space. We then show that the value of the Fisher function can be simply computed by using averages of diagonal and off-diagonal blocks of a kernel matrix. This result further serves to reveal that the ideal kernel matrix is a global solution to the problem of maximizing the Fisher criterion function. Its relation to an empirical kernel target alignment is then reported. To demonstrate the usefulness of these theories, we provide an application study for classification of prostate cancer based on microarray data sets. The results show that the parameter of a kernel function can be readily optimized
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
ISSN
1045-9227

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.