By Topic

Combining Support Vector Machines With a Pairwise Decision Tree

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Jin Chen ; Sch. of Electron. Sci. & Eng., Nat. Univ. of Defense Technol., Changsha ; Cheng Wang ; Runsheng Wang

To address the multiclass classification problem of hyperspectral data, a new method called pairwise decision tree of support vector machines (PDTSVM) is proposed. For an N -class problem, after training N(N - 1)/2 binary support vector machines (SVMs) for each pair of information class, PDTSVM only requires N - 1 binary SVMs for one classification. Based on the separability estimated by the geometric margin between two classes, binary SVMs are recursively selected by using a fast sequential forward selection. Each binary SVM is used to exclude the less-similar class. PDTSVM eliminates the wrong votes of the one-against-one method. It also has much fewer layers than other tree-based methods, which decreases accumulated errors. Tested with an 11-class problem, the results demonstrate the effectiveness of our method.

Published in:

Geoscience and Remote Sensing Letters, IEEE  (Volume:5 ,  Issue: 3 )