How many trees in a random forest?

TM Oshiro, PS Perez, JA Baranauskas - … 2012, Berlin, Germany, July 13-20 …, 2012 - Springer
Random Forest is a computationally efficient technique that can operate quickly over large
datasets. It has been used in many recent research projects and real-world applications in …

Facial expression recognition based on fusion feature of PCA and LBP with SVM

Y Luo, C Wu, Y Zhang - Optik-International Journal for Light and Electron …, 2013 - Elsevier
Facial expressions recognition is an important part of the study in man-machine interface.
Principal component analysis (PCA) is an extraction method based on statistical features …

Facial expression recognition based on a hybrid model combining deep and shallow features

X Sun, M Lv - Cognitive Computation, 2019 - Springer
Facial expression recognition plays an important role in the field involving human-computer
interactions. Given the wide use of convolutional neural networks or other neural network …

Facial expression feature extraction using hybrid PCA and LBP

LUO Yuan, C Wu, Y Zhang - The Journal of China Universities of Posts and …, 2013 - Elsevier
In order to recognize facial expression accurately, the paper proposed a hybrid method of
principal component analysis (PCA) and local binary pattern (LBP). Firstly, the method of …

There is no double-descent in random forests

S Buschjäger, K Morik - arXiv preprint arXiv:2111.04409, 2021 - arxiv.org
Random Forests (RFs) are among the state-of-the-art in machine learning and offer
excellent performance with nearly zero parameter tuning. Remarkably, RFs seem to be …

An assessment on producing synthetic samples by fuzzy C-means for limited number of data in prediction models

EA Sezer, HA Nefeslioglu, C Gokceoglu - Applied Soft Computing, 2014 - Elsevier
For most of rock engineering and engineering geology projects, strength and deformability
parameters of intact rocks have crucial importance. However, it is highly challenging to …

Decision trees as partitioning machines to characterize their generalization properties

JS Leboeuf, F LeBlanc… - Advances in neural …, 2020 - proceedings.neurips.cc
Decision trees are popular machine learning models that are simple to build and easy to
interpret. Even though algorithms to learn decision trees date back to almost 50 years, key …

Assessing generalization ability of majority vote point classifiers

RK Sevakula, NK Verma - IEEE Transactions on Neural …, 2016 - ieeexplore.ieee.org
Classification algorithms have been traditionally designed to simultaneously reduce errors
caused by bias as well by variance. However, there occur many situations where low …

[HTML][HTML] Pitfalls of assessing extracted hierarchies for multi-class classification

P Del Moral, S Nowaczyk, A Sant'Anna, S Pashami - Pattern Recognition, 2023 - Elsevier
Using hierarchies of classes is one of the standard methods to solve multi-class
classification problems. In the literature, selecting the right hierarchy is considered to play a …

VC-dimension of univariate decision trees

OT Yıldız - IEEE transactions on neural networks and learning …, 2015 - ieeexplore.ieee.org
In this paper, we give and prove the lower bounds of the Vapnik-Chervonenkis (VC)-
dimension of the univariate decision tree hypothesis class. The VC-dimension of the …