Random forest regression for manifold-valued responses

Abstract

An increasing array of biomedical and computer vision applications requires the predictive modeling of complex data, for example images and shapes. The main challenge when predicting such objects lies in the fact that they do not comply to the assumptions of Euclidean geometry. Rather, they occupy non-linear spaces, a.k.a. manifolds, where it is difficult to define concepts such as coordinates, vectors and expected values. In this work, we construct a non-parametric predictive methodology for manifold-valued objects, based on a distance modification of the Random Forest algorithm. Our method is versatile and can be applied both in cases where the response space is a well-defined manifold, but also when such knowledge is not available. Model fitting and prediction phases only require the definition of a suitable distance function for the observed responses. We validate our methodology using simulations and apply it on a series of illustrative image completion applications, showcasing superior predictive performance, compared to various established regression methods.

Decision Tree Ensembles Utilizing Multivariate Splits Are Effective at Investigating Beta-Diversity in Medically Relevant 16S Amplicon Sequencing Data

“…Given that amplicon sequencing datasets tend to lie on such manifolds, using learned dissimilarities could represent a potentially powerful way to analyze these datasets. Furthermore, since these dissimilarity matrices are derived from decision tree ensembles, interactions between ASVs are potentially accounted for, thereby overcoming one of the weaknesses of distance metrics (7,43,48). Therefore, using learned dissimilarities could result in the construction of more informative ordinations.…”

Proposition of New Ensemble Data-Intelligence Models for Surface Water Quality Prediction

“…RF is a supervised learning approach that combined the bagging ensemble ML algorithm achieved from the classification and regression tree and the random subspace technique, introduced by Breiman [47]. Despite its simplicity, it is an effective tool that relies on the "divide and conquer" principle to solve multi-regression & prediction problems [48]- [50]. It has low sensitivity to multicollinearity and achieves stable performances on unbalanced datasets.…”

Detección de fallos dinámica y descentralizada basada en métodos de regresión

“…Random Forest es un método basado en losárboles de decisión muy utilizado gracias a su sencillez y robustez frente a cambios en los parámetros [17]. Aunque se suele usar para realizar clasificaciones [20] también es posible aplicarlos para regresión [21,22] El método implementa variosárboles de decisión independientes entre sí, creados a partir de conjuntos de datos aleatorios con igual distribución. Si se parte de una matriz de datos X (n × m) con n observaciones y m variables, el proceso seguido consiste en ir creando las ramas de uń arbol utilizando una muestra aleatoria de p predictores, con p < m, escogidos aleatoriamente entre las m variables.…”