Ensemble of support vector machines for land cover classification

Authors:
M. Pal
Affiliations:
Department of Civil Engineering, National Institute of Technology, Kurukshetra, 136119 Haryana, India
Venue:
International Journal of Remote Sensing
Year:
2008

Citing 12
Cited 0

A training algorithm for optimal margin classifiers

COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
The nature of statistical learning theory

The nature of statistical learning theory
Support-Vector Networks

Machine Learning
Bagging predictors

Machine Learning
Approximate statistical tests for comparing supervised classification learning algorithms

Neural Computation
An introduction to support Vector Machines: and other kernel-based learning methods

An introduction to support Vector Machines: and other kernel-based learning methods
An Experimental Comparison of Three Methods for Constructing Ensembles of Decision Trees: Bagging, Boosting, and Randomization

Machine Learning
An Empirical Comparison of Voting Classification Algorithms: Bagging, Boosting, and Variants

Machine Learning
Linear Programming Boosting via Column Generation

Machine Learning
Neural Network Ensembles

IEEE Transactions on Pattern Analysis and Machine Intelligence
Parallel consensual neural networks

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

This letter presents the results of two different ensemble approaches to increase the accuracy of land cover classification using support vector machines. Finite ensemble approaches, based on boosting and bagging and infinite ensemble created by embedding the infinite hypothesis in the kernel of support vector machines, are discussed. Results suggest that the infinite ensemble approach provides a significant increase in the classification accuracy in comparison to the radial basis function kernel-based support vector machines. While using finite ensemble approaches, bagging works well and provides a comparable performance to the infinite ensemble approach, whereas boosting decreases the performance of support vector machines. Comparison in terms of computational cost suggests that finite ensemble approaches require a large processing time in comparison to the infinite ensemble approach.