中文
相关论文

相关论文: Conclusive Local Interpretation Rules for Random F…

200 篇论文

While balancing covariates between groups is central for observational causal inference, selecting which features to balance remains a challenging problem. Kernel balancing is a promising approach that first estimates a kernel that captures…

统计方法学 · 统计学 2025-12-15 Andy A. Shen , Eli Ben-Michael , Avi Feller , Luke Keele , Jared Murray

The recent years have witnessed the rise of accurate but obscure decision systems which hide the logic of their internal decision processes to the users. The lack of explanations for the decisions of black box systems is a key ethical…

人工智能 · 计算机科学 2018-05-29 Riccardo Guidotti , Anna Monreale , Salvatore Ruggieri , Dino Pedreschi , Franco Turini , Fosca Giannotti

Random forests are popular methods for regression and classification analysis, and many different variants have been proposed in recent years. One interesting example is the Mondrian random forest, in which the underlying constituent trees…

统计理论 · 数学 2025-11-10 Matias D. Cattaneo , Jason M. Klusowski , William G. Underwood

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

To address the contextual bandit problem, we propose an online random forest algorithm. The analysis of the proposed algorithm is based on the sample complexity needed to find the optimal decision stump. Then, the decision stumps are…

机器学习 · 计算机科学 2016-09-16 Raphaël Féraud , Robin Allesiardo , Tanguy Urvoy , Fabrice Clérot

Recursive neural networks (RvNN) have been shown useful for learning sentence representations and helped achieve competitive performance on several natural language inference tasks. However, recent RvNN-based models fail to learn simple…

计算与语言 · 计算机科学 2021-04-13 Atul Sahay , Ayush Maheshwari , Ritesh Kumar , Ganesh Ramakrishnan , Manjesh Kumar Hanawal , Kavi Arya

Probabilistic search algorithms, such as Monte Carlo Tree Search (MCTS), have proven very effective in solving sequential decision-making tasks under uncertainty. However, interpreting asymmetric search trees that incorporate bandit-based…

人机交互 · 计算机科学 2026-05-21 Siqi Lu , Mirsaleh Bahavarnia , Hiba Baroud , Yixuan Zhang , Hemant Purohit , Ayan Mukhopadhyay

Integrated interpretability without sacrificing the prediction accuracy of decision making algorithms has the potential of greatly improving their value to the user. Instead of assigning a label to an image directly, we propose to learn…

机器学习 · 计算机科学 2021-04-13 Stephan Alaniz , Diego Marcos , Bernt Schiele , Zeynep Akata

We propose a random forest estimator for the intensity of spatial point processes, applicable with or without covariates. It retains the well-known advantages of a random forest approach, including the ability to handle a large number of…

统计方法学 · 统计学 2025-11-13 Christophe Biscio , Frédéric Lavancier

Life expectancy is a fundamental indicator of population health and socio-economic well-being, yet accurately forecasting it remains challenging due to the interplay of demographic, environmental, and healthcare factors. This study…

机器学习 · 计算机科学 2025-10-02 Roman Dolgopolyi , Ioanna Amaslidou , Agrippina Margaritou

Tree ensembles are non-parametric methods widely recognized for their accuracy and ability to capture complex interactions. While these models excel at prediction, they are difficult to interpret and may fail to uncover useful relationships…

机器学习 · 统计学 2026-04-01 Brian Liu , Rahul Mazumder , Peter Radchenko

Decision trees and their ensembles are very popular models of supervised machine learning. In this paper we merge the ideas underlying decision trees, their ensembles and FCA by proposing a new supervised machine learning model which can be…

机器学习 · 计算机科学 2021-06-02 Egor Dudyrev , Sergei O. Kuznetsov

In this paper, error estimates of classification Random Forests are quantitatively assessed. Based on the initial theoretical framework built by Bates et al. (2023), the true error rate and expected error rate are theoretically and…

机器学习 · 统计学 2024-08-09 Ian Krupkin , Johanna Hardin

Random forests are a type of ensemble method which makes predictions by combining the results of several independent trees. However, the theory of random forests has long been outpaced by their application. In this paper, we propose a novel…

机器学习 · 计算机科学 2015-07-23 Jianyuan Sun , Guoqiang Zhong , Junyu Dong , Yajuan Cai

Big Data is one of the major challenges of statistical science and has numerous consequences from algorithmic and theoretical viewpoints. Big Data always involve massive data but they also often include online data and data heterogeneity.…

Random forests are among the most popular classification and regression methods used in industrial applications. To be effective, the parameters of random forests must be carefully tuned. This is usually done by choosing values that…

机器学习 · 统计学 2018-07-03 C. H. Bryan Liu , Benjamin Paul Chamberlain , Duncan A. Little , Angelo Cardoso

Assume we are given a set of items from a general metric space, but we neither have access to the representation of the data nor to the distances between data points. Instead, suppose that we can actively choose a triplet of items (A,B,C)…

机器学习 · 统计学 2018-06-19 Siavash Haghiri , Damien Garreau , Ulrike von Luxburg

The issue of estimating residual variance in regression models has experienced relatively little attention in the machine learning community. However, the estimate is of primary interest in many practical applications, e.g. as a primary…

统计理论 · 数学 2018-12-18 Burim Ramosaj , Markus Pauly

Random forests have long been considered as powerful model ensembles in machine learning. By training multiple decision trees, whose diversity is fostered through data and feature subsampling, the resulting random forest can lead to more…

Tree ensembles such as random forests and boosted trees are accurate but difficult to understand, debug and deploy. In this work, we provide the inTrees (interpretable trees) framework that extracts, measures, prunes and selects rules from…

机器学习 · 计算机科学 2014-08-26 Houtao Deng