.png){kind=icon}
Return
Finite Newton method for Lagrangian support vector machine classification
.png){kind=icon}
PRE
AI
DOI：10.1016/S0925-2312(03)00379-5.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
An implicit Lagrangian [Math. Programming Ser. B 62 (1993) 277] formulation of a support vector machine classifier that led to a highly effective iterative scheme [J. Machine Learn. Res. 1 (2001) 161] is solved here by a finite Newton method. The proposed method, which is extremely fast and terminates in 6 or 7 iterations, can handle classification problems in very high dimensional spaces, e.g. over 28,000, in a few seconds on a 400 MHz Pentium II machine. The method can also handle problems with large datasets and requires no specialized software other than a commonly available solver for a system of linear equations. Finite termination of the proposed method is established in this work. (C) 2003 Elsevier B.V. All rights reserved.
Keywords:
classification
Lagrangian support vector machines
Newton method
myeloma
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W
Organization
No organization information available
Cited Papers
Properties of concrete with partial replacement of steel slag with fine aggregate.png)
2017 International Conference on Energy, Communication, Data Analytics and Soft Computing (ICECDS)
2017 International Conference on Energy, Communication, Data Analytics and Soft Computing (ICECDS)IF0
PREAI
ShareSaveShareSaveShareSave
ShareSaveHsa_circ_0012919 regulates expression of MDA5 by miR-125a-3p in CD4+ T cells of systemic lupus erythematousLupus
LupusIF0
PREAI
ShareSaveShareSave
View more