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

DOI10.1007/978-3-642-00580-0_3MaRDI QIDQ4932760zbMATH OpenOpenAlexFDO

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

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

high dimensional dataoblique decision treesrandom forestssupport vector machines

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)

Recommendations

• Sparse projection oblique randomer forests
• An efficient random forests algorithm for high dimensional data classification
• Random forests
• Extremely randomized trees
• Extremely randomized trees

Cited in

(6)

• An efficient random forests algorithm for high dimensional data classification
• Classification of high-dimensional evolving data streams via a resource-efficient online ensemble
• Sparse projection oblique randomer forests
• A Projection Pursuit Forest Algorithm for Supervised Classification
• High-dimensional Canonical Forest
• On multivariate randomized classification trees: \(l_0\)-based sparsity, VC dimension and decomposition methods

Describes a project that uses

Uses Software

• C4.5

This page was built for publication: Classifying very-high-dimensional data with random forests of oblique decision trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4932760)