An efficient random forests algorithm for high dimensional data classification
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 7295881
- Classifying very-high-dimensional data with random forests of oblique decision trees
- Classification by ensembles from random partitions of high-dimensional data
- Ensemble decision forest of RBF networks via hybrid feature clustering approach for high-dimensional data classification
- A random forest guided tour
Cites work
Cited in
(15)- Classification by ensembles from random partitions of high-dimensional data
- A training algorithm for classification of high-dimensional data
- Learning from label proportions on high-dimensional data
- Ensemble decision forest of RBF networks via hybrid feature clustering approach for high-dimensional data classification
- Classifying very-high-dimensional data with random forests of oblique decision trees
- High-dimensional Canonical Forest
- Variable selection and importance in presence of high collinearity: an application to the prediction of lean body mass from multi-frequency bioelectrical impedance
- Weighted random subspace method for high dimensional data classification
- Distributed gradient boosting decision tree algorithm for high-dimensional and multi-classification problems
- An imbalanced feature selection algorithm based on random forest
- Random forest kernel for high-dimension low sample size classification
- A Deep Learning Approach for Network Intrusion Detection Using Non-symmetric Auto-encoder
- Predictive performances of implicitly and explicitly robust classifiers on high dimensional data
- Improved Random Forest for Classification
- Regularized target encoding outperforms traditional methods in supervised machine learning with high cardinality features
This page was built for publication: An efficient random forests algorithm for high dimensional data classification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1630851)
