Neighborhood Random Classification - Université Jean Moulin Lyon 3 Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Neighborhood Random Classification

Fabien Rico
  • Fonction : Auteur correspondant
  • PersonId : 910739

Connectez-vous pour contacter l'auteur
Djamel Abdelkader Zighed
  • Fonction : Auteur
  • PersonId : 860298
Diala Ezzeddine
  • Fonction : Auteur
  • PersonId : 917732

Résumé

Ensemble methods (EMs) have become increasingly popular in data mining because of their efficiency. These methods(EMs) generate a set of classifiers using one or several machine learning algorithms (MLAs) and aggregate them into a single classifier (Meta-Classifier, MC). Amon MLAs, k-Nearest Neighbors (kNN) is one of the most known used in the context of EMs. However, handling the parameter k might be difficult. This drawback exists almost for all MLA that are instances based. Here, we propose an approach based on neighborhood graphs as alternative. Thanks to theses related graphs, like relative neighborhood graphs (RNGs) or Gabriel graphs (GGs), we provide a generalized approach with less arbitrary parameters. Introducing neighborhood graphs in EMs approaches has never been done before. The results of our algorithm : Neighborhood Random Classification are very promising since they are equal to the best EMs approaches such as Random Forest or those based on SVMs. In this exploratory and experimental work, we provide the methodological approach and we provide many comparison results.
Fichier non déposé

Dates et versions

hal-00660745 , version 1 (17-01-2012)

Identifiants

Citer

Fabien Rico, Djamel Abdelkader Zighed, Diala Ezzeddine. Neighborhood Random Classification. The 16th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD), May 2012, Kuala Lumpur, Malaysia. pp.98-108, ⟨10.1007/978-3-642-30217-6_9⟩. ⟨hal-00660745⟩
130 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More