DocumentCode
1733631
Title
Multi-modal Tree-Based SVM Classification
Author
Freeman, Chas ; Kulic, Dana ; Basir, Otman
Author_Institution
Dept. of Electr. & Comput. Eng., Univ. of Waterloo, Waterloo, ON, Canada
Volume
1
fYear
2013
Firstpage
65
Lastpage
71
Abstract
This paper presents a method for designing binary trees for SVM classification. The proposed algorithm, multi-modal binary tree (MBT) tolerates misclassification in the upper nodes of the tree, allowing points to be classified in either output regardless of the initial specified class groupings. MBT can separate classes that are inseparable with a single classifier by using a piecewise division. The algorithm also incorporates feature selection for the individual classifiers in the system. Classification results on several artificial and real data sets show that the proposed algorithm performs well compared to existing methods for multi-class SVM classification, and although the classifiers are larger, the time required to classify a point is smaller.
Keywords
feature selection; pattern classification; support vector machines; tree data structures; binary trees design; feature selection; multiclass SVM classification; multimodal binary tree; multimodal tree-based SVM classification; piecewise division; support vector machines; Accuracy; Binary trees; Cancer; Decision trees; Noise; Support vector machines; Training; classification algorithms; supervised learning; support vector machines;
fLanguage
English
Publisher
ieee
Conference_Titel
Machine Learning and Applications (ICMLA), 2013 12th International Conference on
Conference_Location
Miami, FL
Type
conf
DOI
10.1109/ICMLA.2013.19
Filename
6784589
Link To Document