In this paper, the multiple random subset-kernel learning (MRSKL) algorithm is proposed. In MRSKL, a subset of training samples is randomly selected for each kernel with randomly set parameters, and the kernels with optimal weights are combined for classification. A linear support vector machine (SVM) is adopted to determine the optimal kernel weights; therefore, MRSKL is based on a hierarchical SVM. MRSKL outperforms a single SVM even when using a small number of samples (200 to 400 out of 20,000 training samples), while the SVM requires more than 4,000 support vectors. © 2011 Springer-Verlag.
CITATION STYLE
Nishida, K., Fujiki, J., & Kurita, T. (2011). Multiple random subset-kernel learning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6854 LNCS, pp. 343–350). https://doi.org/10.1007/978-3-642-23672-3_42
Mendeley helps you to discover research relevant for your work.