Classifying Very-High-Dimensional Data with Random Forests of Oblique Decision Trees

DOI10.1007/978-3-642-00580-0_3zbMath1202.68309OpenAlexW1498843717MaRDI QIDQ4932760

Nguyen Pham, Thanh-Nghi do, Stéphane Lallich, Philippe Lenca

Publication date: 6 October 2010

Published in: Advances in Knowledge Discovery and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00580-0_3

zbMATH Keywords

support vector machinesrandom forestshigh dimensional dataoblique decision trees

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

A Projection Pursuit Forest Algorithm for Supervised Classification ⋮ Classification of high-dimensional evolving data streams via a resource-efficient online ensemble

Uses Software

• C4.5

This page was built for publication: Classifying Very-High-Dimensional Data with Random Forests of Oblique Decision Trees