A simple learning algorithm for maximal margin classiΓΏers (also support vector machines with quadratic cost function) is proposed. We build our iterative algorithm on top of the Schlesinger-Kozinec algorithm (S-K-algorithm) from 1981 which ΓΏnds a maximal margin hyperplane with a given precision for
β¦ LIBER β¦
A hierarchical multiple classifier learning algorithm
β Scribed by Y.-Y. Chou; L. G. Shapiro
- Publisher
- Springer-Verlag
- Year
- 2003
- Tongue
- English
- Weight
- 473 KB
- Volume
- 6
- Category
- Article
- ISSN
- 1433-7541
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
An iterative algorithm learning the maxi
β
VojtΔch Franc; VΓ‘clav HlavΓ‘Δ
π
Article
π
2003
π
Elsevier Science
π
English
β 444 KB
Fidelity Estimation for a Hierarchical C
β
P. Hufnagl; K. Voss
π
Article
π
1985
π
John Wiley and Sons
π
English
β 377 KB
To estimate the correct classification rate of a classifier, many different methods exkt (test fample, bootstrap, cross validation). The test sample is a method with very small expense. Sometimes, only a small number of objects is available (seldom diseases, high costs for experiments). When we spli
Decision rules for a hierarchical classi
β
Marek W. KurzyΕski
π
Article
π
1983
π
Elsevier Science
π
English
β 354 KB
Hierarchical Fusion of Multiple Classifi
β
Shailesh Kumar; Joydeep Ghosh; Melba M. Crawford
π
Article
π
2002
π
Springer-Verlag
π
English
β 191 KB
Learning classifier systems: a survey
β
Olivier Sigaud; Stewart W. Wilson
π
Article
π
2007
π
Springer
π
English
β 334 KB
A supervised learning algorithm for hier
β
Prasenjit Biswas; Arun K. Majumdar
π
Article
π
1983
π
Elsevier Science
π
English
β 807 KB