Improving accuracy and speed of optimum-path forest classifier using combination of disjoint training subsets

Authors:
Moacir P. Ponti, Jr.;João P. Papa
Affiliations:
Institute of Mathematical and Computer Sciences, University of São Paulo, São Carlos, SP, Brazil;Department of Computing, Univ Estadual Paulista, Bauru, SP, Brazil
Venue:
MCS'11 Proceedings of the 10th international conference on Multiple classifier systems
Year:
2011

Citing 11
Cited 1

Boosting a weak learning algorithm by majority

Information and Computation
Bagging predictors

Machine Learning
Combination of Multiple Classifiers Using Local Accuracy Estimates

IEEE Transactions on Pattern Analysis and Machine Intelligence
The Random Subspace Method for Constructing Decision Forests

IEEE Transactions on Pattern Analysis and Machine Intelligence
Pasting Small Votes for Classification in Large Databases and On-Line

Machine Learning
Distributed Pasting of Small Votes

MCS '02 Proceedings of the Third International Workshop on Multiple Classifier Systems
Automatic Linguistic Indexing of Pictures by a Statistical Modeling Approach

IEEE Transactions on Pattern Analysis and Machine Intelligence
Multilayer Perceptron Classifier Combination for Identification of Materials on Noisy Soil Science Multispectral Images

SIBGRAPI '07 Proceedings of the XX Brazilian Symposium on Computer Graphics and Image Processing
Supervised pattern classification based on optimum-path forest

International Journal of Imaging Systems and Technology - Contemporary Challenges in Combinatorial Image Analysis
A Labelled Graph Based Multiple Classifier System

MCS '09 Proceedings of the 8th International Workshop on Multiple Classifier Systems
“Good” and “bad” diversity in majority vote ensembles

MCS'10 Proceedings of the 9th international conference on Multiple Classifier Systems

A markov random field model for combining optimum-path forest classifiers using decision graphs and game strategy approach

CIARP'11 Proceedings of the 16th Iberoamerican Congress conference on Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Optimum-Path Forest (OPF) classifier is a recent and promising method for pattern recognition, with a fast training algorithm and good accuracy results. Therefore, the investigation of a combining method for this kind of classifier can be important for many applications. In this paper we report a fast method to combine OPF-based classifiers trained with disjoint training subsets. Given a fixed number of subsets, the algorithm chooses random samples, without replacement, from the original training set. Each subset accuracy is improved by a learning procedure. The final decision is given by majority vote. Experiments with simulated and real data sets showed that the proposed combining method is more efficient and effective than naive approach provided some conditions. It was also showed that OPF training step runs faster for a series of small subsets than for the whole training set. The combining scheme was also designed to support parallel or distributed processing, speeding up the procedure even more.