Matrix pattern based minimum within-class scatter support vector machines

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

Abstract

Based on minimum within-class scatter support vector machines (MCSVM), a new matrix pattern based MCSSVM (MCSVMmatrix) is presented. Accordingly, it is extended by introducing Mercer's kernels in order to solve the problem of nonlinear decision boundaries, which presents a significant matrix pattern based nonlinear support vector machines: Ker-MCSVM matrix. The above-mentioned approaches not only keep the merits of MCSVM, but, owing to introducing matrix pattern based within-class scatter matrix into support vector machines, theoretically better solve the singular problem of within-class scatter matrix when small sample size problems are dealt with, reduce the time/place complexity when within-class scatter matrix, its invertible matrix and weight vector ω are calculated. Hence, the classification accuracy is improved to certain extent. Experimental results indicate the above advantages of the proposed methods: both MCSVM matrix and Ker-MCSVMmatrix. © 2011 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Jun, G., Chung, F. L., & Wang, S. (2011). Matrix pattern based minimum within-class scatter support vector machines. Applied Soft Computing Journal, 11(8), 5602–5610. https://doi.org/10.1016/j.asoc.2011.04.004

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