title: A kernel-induced space selection approach to model selection in KLDA.
abstract: Model selection in kernel linear discriminant analysis (KLDA) refers to the selection of appropriate parameters of a kernel function and the regularizer. By following the principle of maximum information preservation, this paper formulates the model selection problem as a problem of selecting an optimal kernel-induced space in which different classes are maximally separated from each other. A scatter-matrix-based criterion is developed to measure the "goodness" of a kernel-induced space, and the kernel parameters are tuned by maximizing this criterion. This criterion is computationally efficient and is differentiable with respect to the kernel parameters. Compared with the leave-one-out (LOO) or k-fold cross validation (CV), the proposed approach can achieve a faster model selection, especially when the number of training samples is large or when many kernel parameters need to be tuned. To tune the regularization parameter in the KLDA, our criterion is used together with the method proposed by Saadi (2004). Experiments on benchmark data sets verify the effectiveness of this model selection approach.
authors.affiliation: Research School of Information Sciences and Engineering, The Australian National University, Canberra, ACT 0200, Australia. Lei.Wang@rsise.anu.edu.au
authors.forename: Lei
authors.initials: L
authors.lastname: Wang
authors.forename: Kap Luk
authors.initials: KL
authors.lastname: Chan
authors.forename: Ping
authors.initials: P
authors.lastname: Xue
authors.forename: Luping
authors.initials: L
authors.lastname: Zhou
mesh_terms: D000465:Algorithms; D001185:Artificial Intelligence; D003198:Computer Simulation; D016002:Discriminant Analysis; D016014:Linear Models; D010363:Pattern Recognition, Automated / Q000379:methods*