Multi-stage decision tree based on inter-class and inner-class margin of SVM

Authors:
Mingzhu Lu;C. L. Philip Chen;Jianbing Huo;Xizhao Wang
Affiliations:
Department of Electrical and Computer Engineering, University of Texas at San Antonio, San Antonio, TX;Department of Electrical and Computer Engineering, University of Texas at San Antonio, San Antonio, TX;The People's bank of China, Shijiazhuang, China;College of Mathematics and Computer Science, Hebei University, Baoding, China
Venue:
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Year:
2009

Citing 7
Cited 0

The nature of statistical learning theory

The nature of statistical learning theory
Principles of data mining

Principles of data mining
Induction of Decision Trees

Machine Learning
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Letters: A genetic algorithm for solving the inverse problem of support vector machines

Neurocomputing
An overview of statistical learning theory

IEEE Transactions on Neural Networks
A comparison of methods for multiclass support vector machines

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Motivated by overcoming the drawbacks of traditional decision tree and improving the efficiency of large margin learning based multi-stage decision tree when dealing with multi-class classification problems, this paper proposes a novel Multi-stage Decision Tree algorithm based on interclass and inner class margin of SVM. This new algorithm is well designed for multi-class classification problem based on the maximum margin of SVM and the cohesion and coupling theory of clustering. Considering the multi-class classification problem as a clustering problem, this new algorithm attempts to convert the multi-class classification problem into a two-class classification problem such that the highest cohesion degree within classes while lowest coupling degree between classes, where the margin of SVM is considered as the measurement of the degree. Then for each two-class problem, this paper uses traditional C4.5 algorithm to generate each stage decision tree which splits a dataset into two subsets for the further induction. Recursively, the Multi-stage decision tree is obtained. Numerical simulations and theoretical analysis show this new multi-stage decision tree improves the performance of traditional decision tree and decreases the computational complexity a lot compare with large margin learning based multi-stage decision tree.