Sparse projection oblique randomer forests
From MaRDI portal
Recommendations
Cites work
- Arcing classifiers. (With discussion)
- Consistency of random forests
- Consistency of random forests and other averaging classifiers
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Do we need hundreds of classifiers to solve real world classification problems?
- Greedy function approximation: A gradient boosting machine.
- scientific article; zbMATH DE number 893887 (Why is no real title available?)
- scientific article; zbMATH DE number 5485566 (Why is no real title available?)
- Machine learning and knowledge discovery in databases. European conference, ECML PKDD 2011, Athens, Greece, September 5--9, 2011. Proceedings, Part II
- Random forests
- Random Projection Trees for Vector Quantization
- Random rotation ensembles
- Tunability: importance of hyperparameters of machine learning algorithms
- Variance and bias for general loss functions
Cited in
(9)- Shape modeling with spline partitions
- Sparsity in optimal randomized classification trees
- Classifying very-high-dimensional data with random forests of oblique decision trees
- Manifold Oblique Random Forests: Towards Closing the Gap on Convolutional Deep Networks
- Convergence Rates of Oblique Regression Trees for Flexible Function Libraries
- Accelerated and Interpretable Oblique Random Survival Forests
- Consistency of the oblique decision tree and its boosting and random forest
- Tree oblique for regression with weighted support vector machine
- The infinitesimal jackknife and combinations of models
Describes a project that uses
Uses Software
This page was built for publication: Sparse projection oblique randomer forests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4969173)