Classifying very-high-dimensional data with random forests of oblique decision trees - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2010

Classifying very-high-dimensional data with random forests of oblique decision trees

Résumé

The random forests method is one of the most successful ensemble methods. However, random forests do not have high performance when dealing with very-high-dimensional data in presence of dependencies. In this case one can expect that there exist many combinations between the variables and unfortunately the usual random forests method does not effectively exploit this situation. We here investigate a new approach for supervised classification with a huge number of numerical attributes. We propose a random oblique decision trees method. It consists of randomly choosing a subset of predictive attributes and it uses SVM as a split function of these attributes.We compare, on 25 datasets, the effectiveness with classical measures (e.g. precision, recall, F1-measure and accuracy) of random forests of random oblique decision trees with SVMs and random forests of C4.5. Our proposal has significant better performance on very-high-dimensional datasets with slightly better results on lower dimensional datasets.
Fichier non déposé

Dates et versions

hal-00523124 , version 1 (04-10-2010)

Identifiants

  • HAL Id : hal-00523124 , version 1

Citer

Thanh Nghi Do, Philippe Lenca, Stéphane Lallich, Nguyen-Khang Pham. Classifying very-high-dimensional data with random forests of oblique decision trees. Advances in knowledge discovery and management, Springer, pp.39 - 55, 2010, vol. 292 - Studies in computational intelligence, 978-3-642-00579-4. ⟨hal-00523124⟩
357 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More