.png){kind=icon}
.png){kind=icon}
Return
GS-BART: Bayesian Additive Regression Trees with Graph-Split Decision Rules
.png){kind=icon}
PRE
AI
S
H
Q
DOI：10.1080/01621459.2026.2655550.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Ensemble decision tree methods such as XGBoost, Random Forest, and Bayesian Additive Regression Trees (BART) have gained enormous popularity in data science for their superior performance in machine learning regression and classification tasks. In this article, we introduce a new Bayesian graph-split additive decision tree method, GS-BART, designed to enhance the performance of axis-parallel split-based BART for dependent data with graph structures. The proposed approach encodes input feature information into candidate graph sets and employs a flexible split rule that respects the graph topology when constructing decision trees. We consider a generalized nonparametric regression model using GS-BART and design a scalable informed MCMC algorithm to sample the decision trees of GS-BART. The algorithm leverages a gradient-based recursive algorithm on root directed spanning trees or chains. The superior performance of the method over conventional ensemble tree models and Gaussian process regression models is illustrated in various regression and classification tasks for spatial and network data analysis. Supplementary materials for this article are available online, including a standardized description of the materials available for reproducing the work.
Keywords:
Bayesian nonparametric regression
Complex domain
Decision trees
Informed MCMC
Spanning tree
Spatial prediction
Journal
J
IF:
3
Papers:
5.1K
Citations:
4.8W
Organization
Cited Papers