Advertisement
Published in:
2009 | OriginalPaper | Chapter
Disturbing Neighbors Ensembles for Linear SVM
Authors : Jesús Maudes, Juan J. Rodríguez, César García-Osorio
Published in: Multiple Classifier Systems
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Ensembles need their base classifiers do not always agree for any prediction (
diverse
base classifiers). Disturbing Neighbors (
$\mathcal{DN}$
) is a method for improving the diversity of the base classifiers of any ensemble algorithm.
$\mathcal{DN}$
builds for each base classifier a set of extra features based on a 1-Nearest Neighbors (1-NN) output. These 1-NN are built using a small subset of randomly selected instances from the training dataset.
$\mathcal{DN}$
has already been proved successfully on unstable base classifiers (i.e. decision trees). This paper presents an experimental validation on 62 UCI datasets for standard ensemble methods using Support Vector Machines (SVM) with a linear kernel as base classifiers. SVMs are very stable, so it is hard to increase their diversity when they belong to an ensemble. However, experiments will show that
$\mathcal{DN}$
usually improves ensemble accuracy and base classifiers diversity.