Neighborhood random classification

Abstract

Ensemble methods (EMs) have become increasingly popular in data mining because of their efficiency. These methods generate a set of classifiers using one or several machine learning algorithms (MLAs) and aggregate them into a single classifier (Meta-Classifier, MC). Decision trees (DT), SVM and k-Nearest Neighbors (kNN) are among the most well-known used in the context of EMs. Here, we propose an approach based on neighborhood graphs as an alternative. Thanks to these related graphs, like relative neighborhood graphs (RNGs), Gabriel graphs (GGs) or Minimum Spanning Tree (MST), we provide a generalized approach to the kNN approach with less arbitrary parameters such as the value of k. Neighborhood graphs have never been introduced into EM approaches before. The results of our algorithm : Neighborhood Random Classification are very promising as they are equal to the best EM approaches such as Random Forest or those based on SVMs. In this preliminary and experimental work, we provide the methodological approach and many comparative results. We also provide some results on the influence of neighborhood structure regarding the efficiency of the classifier and draw some issues that deserves to be studied. © 2013 Springer-Verlag.