Abstract
A novel algorithm for multi-class support vector machines (SVMs) is proposed in this paper. The tree constructed in our algorithm consists of a series of two-class SVMs. Considering both separability and balance, in each iteration multi-class patterns are divided into two sets according to the distances between pairwise classes and the number of patterns in each class. This algorithm can well treat with the unequally distributed problems. The efficiency of the proposed method are verified by the experimental results.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - 2008 International Conference on Advanced Computer Theory and Engineering, ICACTE 2008 |
| Pages | 327-331 |
| Number of pages | 5 |
| DOIs | |
| Publication status | Published - 2008 |
| Externally published | Yes |
| Event | 2008 International Conference on Advanced Computer Theory and Engineering, ICACTE 2008 - Phuket, Thailand Duration: Dec 20 2008 → Dec 22 2008 |
Other
| Other | 2008 International Conference on Advanced Computer Theory and Engineering, ICACTE 2008 |
|---|---|
| Country | Thailand |
| City | Phuket |
| Period | 12/20/08 → 12/22/08 |
Fingerprint
ASJC Scopus subject areas
- Computational Theory and Mathematics
- Software
Cite this
An efficient algorithm for multi-class support vector machines. / Guo, Jun; Takahashi, Norikazu; Hu, Wenxin.
Proceedings - 2008 International Conference on Advanced Computer Theory and Engineering, ICACTE 2008. 2008. p. 327-331 4736975.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - An efficient algorithm for multi-class support vector machines
AU - Guo, Jun
AU - Takahashi, Norikazu
AU - Hu, Wenxin
PY - 2008
Y1 - 2008
N2 - A novel algorithm for multi-class support vector machines (SVMs) is proposed in this paper. The tree constructed in our algorithm consists of a series of two-class SVMs. Considering both separability and balance, in each iteration multi-class patterns are divided into two sets according to the distances between pairwise classes and the number of patterns in each class. This algorithm can well treat with the unequally distributed problems. The efficiency of the proposed method are verified by the experimental results.
AB - A novel algorithm for multi-class support vector machines (SVMs) is proposed in this paper. The tree constructed in our algorithm consists of a series of two-class SVMs. Considering both separability and balance, in each iteration multi-class patterns are divided into two sets according to the distances between pairwise classes and the number of patterns in each class. This algorithm can well treat with the unequally distributed problems. The efficiency of the proposed method are verified by the experimental results.
UR - http://www.scopus.com/inward/record.url?scp=62949208053&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=62949208053&partnerID=8YFLogxK
U2 - 10.1109/ICACTE.2008.48
DO - 10.1109/ICACTE.2008.48
M3 - Conference contribution
AN - SCOPUS:62949208053
SN - 9780769534893
SP - 327
EP - 331
BT - Proceedings - 2008 International Conference on Advanced Computer Theory and Engineering, ICACTE 2008
ER -