Bilinear formulated multiple kernel learning for multi-class classification problem

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we propose a method of multiple kernel learning (MKL) to inherently deal with multi-class classification problems. The performances of kernel-based classification methods depend on the employed kernel functions, and it is difficult to predefine the optimal kernel. In the framework of MKL, multiple types of kernel functions are linearly integrated with optimizing the weights for the kernels. However, the multi-class problems are rarely incorporated in the formulation and the optimization is time-consuming. We formulate the multi-class MKL in a bilinear form and propose a scheme for computationally efficient optimization. The scheme makes the method favorably applicable to large-scaled samples in the real-world problems. In the experiments on multi-class classification using several datasets, the proposed method exhibits the favorable performance and low computation time compared to the previous methods. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Kobayashi, T., & Otsu, N. (2010). Bilinear formulated multiple kernel learning for multi-class classification problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6444 LNCS, pp. 99–107). https://doi.org/10.1007/978-3-642-17534-3_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free