中文
相关论文

相关论文: Understanding overfitting in random forest for pro…

200 篇论文

The random forest algorithm, proposed by L. Breiman in 2001, has been extremely successful as a general-purpose classification and regression method. The approach, which combines several randomized decision trees and aggregates their…

统计理论 · 数学 2015-11-19 Gérard Biau , Erwan Scornet

The wealth of data being gathered about humans and their surroundings drives new machine learning applications in various fields. Consequently, more and more often, classifiers are trained using not only numerical data but also complex data…

机器学习 · 计算机科学 2022-04-13 Maciej Piernik , Dariusz Brzezinski , Pawel Zawadzki

We seek decision rules for prediction-time cost reduction, where complete data is available for training, but during prediction-time, each feature can only be acquired for an additional cost. We propose a novel random forest algorithm to…

机器学习 · 统计学 2015-02-23 Feng Nan , Joseph Wang , Venkatesh Saligrama

Random forest regression is a powerful non-parametric method that adapts to local data characteristics through data-driven partitioning, making it effective across diverse application domains. However, the piecewise constant nature of…

机器学习 · 计算机科学 2026-05-19 Ziyi Liu , Phuc Luong , Mario Boley , Daniel F. Schmidt

Random Forest (RF) is an ensemble supervised machine learning technique that was developed by Breiman over a decade ago. Compared with other ensemble techniques, it has proved its accuracy and superiority. Many researchers, however, believe…

机器学习 · 计算机科学 2015-03-18 Khaled Fawagreh , Mohamad Medhat Gaber , Eyad Elyan

We propose a novel algorithm for optimizing multivariate linear threshold functions as split functions of decision trees to create improved Random Forest classifiers. Standard tree induction methods resort to sampling and exhaustive search…

机器学习 · 计算机科学 2015-06-26 Mohammad Norouzi , Maxwell D. Collins , David J. Fleet , Pushmeet Kohli

We propose generalized random forests, a method for non-parametric statistical estimation based on random forests (Breiman, 2001) that can be used to fit any quantity of interest identified as the solution to a set of local moment…

统计方法学 · 统计学 2018-04-06 Susan Athey , Julie Tibshirani , Stefan Wager

Tree-based ensemble methods, as Random Forests and Gradient Boosted Trees, have been successfully used for regression in many applications and research studies. Furthermore, these methods have been extended in order to deal with uncertainty…

机器学习 · 计算机科学 2018-11-20 Myriam Tami , Marianne Clausel , Emilie Devijver , Adrien Dulac , Eric Gaussier , Stefan Janaqi , Meriam Chebre

Random Forests have been extensively used in regression and classification, inspiring the development of various forest-based methods. Among these, Mondrian Forests, derived from the Mondrian process, mark a significant advancement.…

统计理论 · 数学 2025-02-28 Haoran Zhan , Jingli Wang , Yingcun Xia

The robustification of pattern recognition techniques has been the subject of intense research in recent years. Despite the multiplicity of papers on the subject, very few articles have deeply explored the topic of robust classification in…

应用统计 · 统计学 2015-01-06 Necla Gunduz , Ernest Fokoue

In this paper we propose using the principle of boosting to reduce the bias of a random forest prediction in the regression setting. From the original random forest fit we extract the residuals and then fit another random forest to these…

机器学习 · 统计学 2021-02-25 Indrayudh Ghosal , Giles Hooker

Recent research has shown that artificial intelligence (AI) models can exhibit bias in performance when trained using data that are imbalanced by protected attribute(s). Most work to date has focused on deep learning models, but classical…

机器学习 · 计算机科学 2023-10-02 Mohamed Huti , Tiarna Lee , Elinor Sawyer , Andrew P. King

We introduce random survival forests, a random forests method for the analysis of right-censored survival data. New survival splitting rules for growing survival trees are introduced, as is a new missing data algorithm for imputing missing…

应用统计 · 统计学 2008-11-12 Hemant Ishwaran , Udaya B. Kogalur , Eugene H. Blackstone , Michael S. Lauer

Environmental data may be "large" due to number of records, number of covariates, or both. Random forests has a reputation for good predictive performance when using many covariates with nonlinear relationships, whereas spatial regression,…

应用统计 · 统计学 2018-12-27 Eric W. Fox , Jay M. Ver Hoef , Anthony R. Olsen

Domain generalization is a popular machine learning technique that enables models to perform well on the unseen target domain, by learning from multiple source domains. Domain generalization is useful in cases where data is limited,…

计算机视觉与模式识别 · 计算机科学 2024-01-10 Yuyang Sun , Panagiotis Kosmas

We study the effectiveness of randomizing split-directions in random forests. Prior literature has shown that, on the one hand, randomization can reduce variance through decorrelation, and, on the other hand, randomization regularizes and…

机器学习 · 统计学 2025-04-18 C. Revelas , O. Boldea , B. J. M. Werker

We propose a novel methodology, forest floor, to visualize and interpret random forest (RF) models. RF is a popular and useful tool for non-linear multi-variate classification and regression, which yields a good trade-off between robustness…

机器学习 · 统计学 2016-07-05 Soeren H. Welling , Hanne H. F. Refsgaard , Per B. Brockhoff , Line H. Clemmensen

Random forests are a statistical learning method widely used in many areas of scientific research because of its ability to learn complex relationships between input and output variables and also its capacity to handle high-dimensional…

机器学习 · 统计学 2024-02-19 Louis Capitaine , Jérémie Bigot , Rodolphe Thiébaut , Robin Genuer

The data made available for analysis are becoming more and more complex along several directions: high dimensionality, number of examples and the amount of labels per example. This poses a variety of challenges for the existing machine…

机器学习 · 计算机科学 2020-08-11 Matej Petković , Sašo Džeroski , Dragi Kocev

Prognostic outcomes related to hospital admissions typically do not suffer from censoring, and can be modeled either categorically or as time-to-event. Competing events are common but often ignored. We compared the performance of random…