A hierarchical multiclass support vector machine incorporated with holistic triple learning units
Autor: | Kang Li, George W. Irwin, Xiao-Lei Xia |
---|---|
Rok vydání: | 2010 |
Předmět: |
Structured support vector machine
business.industry Decision tree Pattern recognition Machine learning computer.software_genre Theoretical Computer Science Relevance vector machine Support vector machine ComputingMethodologies_PATTERNRECOGNITION Least squares support vector machine Margin classifier Geometry and Topology Artificial intelligence business Time complexity Classifier (UML) computer Software Mathematics |
Zdroj: | Soft Computing. 15:833-843 |
ISSN: | 1433-7479 1432-7643 |
DOI: | 10.1007/s00500-010-0551-9 |
Popis: | This paper proposes a new hierarchical learning structure, namely the holistic triple learning (HTL), for extending the binary support vector machine (SVM) to multi-classification problems. For an N-class problem, a HTL constructs a decision tree up to a depth of $$\lceil N/3\rceil+1$$. A leaf node of the decision tree is allowed to be placed with a holistic triple learning unit whose generalisation abilities are assessed and approved. Meanwhile, the remaining nodes in the decision tree each accommodate a standard binary SVM classifier. The holistic triple classifier is a regression model trained on three classes, whose training algorithm is originated from a recently proposed implementation technique, namely the least-squares support vector machine (LS-SVM). A major novelty with the holistic triple classifier is the reduced number of support vectors in the solution. For the resultant HTL-SVM, an upper bound of the generalisation error can be obtained. The time complexity of training the HTL-SVM is analysed, and is shown to be comparable to that of training the one-versus-one (1-vs.-1) SVM, particularly on small-scale datasets. Empirical studies show that the proposed HTL-SVM achieves competitive classification accuracy with a reduced number of support vectors compared to the popular 1-vs-1 alternative. |
Databáze: | OpenAIRE |
Externí odkaz: |