Kernel matching pursuit classifier ensemble

Authors:
Licheng Jiao;Qing Li
Affiliations:
Institute of Intelligent Processing and National Key Laboratory of Radar Signal Processing, Xidian University, P.O. Box 224, Xi'an 710071, PR China;Institute of Intelligent Processing and National Key Laboratory of Radar Signal Processing, Xidian University, P.O. Box 224, Xi'an 710071, PR China
Venue:
Pattern Recognition
Year:
2006

Citing 10
Cited 3

The nature of statistical learning theory

The nature of statistical learning theory
Fast training of support vector machines using sequential minimal optimization

Advances in kernel methods
An Experimental Comparison of Three Methods for Constructing Ensembles of Decision Trees: Bagging, Boosting, and Randomization

Machine Learning
Ensembling neural networks: many could be better than all

Artificial Intelligence
Kernel Matching Pursuit

Machine Learning
Neural Network Ensembles

IEEE Transactions on Pattern Analysis and Machine Intelligence
Estimation of Dependences Based on Empirical Data: Springer Series in Statistics (Springer Series in Statistics)

Estimation of Dependences Based on Empirical Data: Springer Series in Statistics (Springer Series in Statistics)
Bagging, boosting, and C4.S

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Matching pursuits with time-frequency dictionaries

IEEE Transactions on Signal Processing
An overview of statistical learning theory

IEEE Transactions on Neural Networks

A Kernel Matching Pursuit Approach to Man-Made Objects Detection in Aerial Images

IbPRIA '07 Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part II
Greedy optimization classifiers ensemble based on diversity

Pattern Recognition
Refining kernel matching pursuit

ISNN'10 Proceedings of the 7th international conference on Advances in Neural Networks - Volume Part II

Quantified Score

Hi-index	0.01

Visualization

Abstract

Kernel Matching Pursuit Classifier (KMPC), a novel classification machine in pattern recognition, has an excellent advantage in solving classification problems for the sparsity of the solution. Unfortunately, the performance of the KMPC is far from the theoretically expected level of it. Ensemble Methods are learning algorithms that construct a collection of individual classifiers which are independent and yet accurate, and then classify a new data point by taking vote of their predictions. In such a way, the performance of classifiers can be improved greatly. In this paper, on a thorough investigation into the principle of KMPC and Ensemble Method, we expatiate on the theory of KMPC ensemble and pointed out the ways to construct it. The experiments performed on the artificial data and UCI data show KMPC ensemble combines the advantages of KMPC with ensemble method, and improves classification performance remarkably.