Minimal Complexity Support Vector Machines for Pattern Classification
Minimal complexity machines (MCMs) minimize the VC (Vapnik-Chervonenkis) dimension to obtain high generalization abilities. However, because the regularization term is not included in the objective function, the solution is not unique. In this paper, to solve this problem, we discuss fusing the MCM...
Na minha lista:
| Autor principal: | |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
MDPI AG
2020-11-01
|
| Colecção: | Computers |
| Assuntos: | |
| Acesso em linha: | https://www.mdpi.com/2073-431X/9/4/88 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|