ACM Home Page
Please provide us with feedback. Feedback
Discriminant kernel and regularization parameter learning via semidefinite programming
Full text PdfPdf (291 KB)
Source ICML; Vol. 227 archive
Proceedings of the 24th international conference on Machine learning table of contents
Corvalis, Oregon
Pages: 1095 - 1102  
Year of Publication: 2007
ISBN:978-1-59593-793-3
Authors
Jieping Ye  Arizona State University, Tempe, AZ
Jianhui Chen  Arizona State University, Tempe, AZ
Shuiwang Ji  Arizona State University, Tempe, AZ
Sponsor
: Machine Learning Journal
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 29,   Citation Count: 3
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1273496.1273634
What is a DOI?

ABSTRACT

Regularized Kernel Discriminant Analysis (RKDA) performs linear discriminant analysis in the feature space via the kernel trick. The performance of RKDA depends on the selection of kernels. In this paper, we consider the problem of learning an optimal kernel over a convex set of kernels. We show that the kernel learning problem can be formulated as a semidefinite program (SDP) in the binary-class case. We further extend the SDP formulation to the multi-class case. It is based on a key result established in this paper, that is, the multi-class kernel learning problem can be decomposed into a set of binary-class kernel learning problems. In addition, we propose an approximation scheme to reduce the computational complexity of the multi-class SDP formulation. The performance of RKDA also depends on the value of the regularization parameter. We show that this value can be learned automatically in the framework. Experimental results on benchmark data sets demonstrate the efficacy of the proposed SDP formulations.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
 
4
 
5
Crammer, K., Keshet, J., & Singer, Y. (2003). Kernel design using boosting. NIPS (pp. 537--544).
 
6
7
 
8
Golub, G. H., & Van Loan, C. F. (1996). Matrix computations. The Johns Hopkins University Press. Third edition.
 
9
10
11
 
12
 
13
14
 
15
 
16
Mika, S., Rätsch, G., & Müüller, K.-R. (2001). A mathematical programming approach to the kernel fisher algorithm. NIPS (pp. 591--597). MIT Press.
 
17
 
18
Newman, D., Hettich, S., Blake, C., & Merz, C. (1998). UCI repository of machine learning databases.
 
19
 
20
 
21
Schölkopf, S., & Smola, A. (2002). Learning with kernels: Support vector machines, regularization, optimization and beyond. MIT Press.
 
22
 
23
Sturm, J. F. (1999). Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optimization Methods and Software, 11--12, 625--653.
 
24
Tsang, I. W., & Kwok, J. T. (2006). Efficient hyperkernel learning using second-order cone programming. IEEE Trans. on Neural Networks, 17, 48--58.
 
25
 
26
Vapnik, V. (1998). Statistical learning theory. Wiley, New York.
 
27
Ye, J., Chen, J., Li, Q., & Kumar, S. (2006). Classification of drosophila embryonic developmental stage range based on gene expression pattern images. Computational Systems Bioinformatics Conference (pp. 293--298).

Collaborative Colleagues:
Jieping Ye: colleagues
Jianhui Chen: colleagues
Shuiwang Ji: colleagues