Online Binary Space Partitioning Forests
arXiv:2003.00269
Abstract
The Binary Space Partitioning-Tree~(BSP-Tree) process was recently proposed as an efficient strategy for space partitioning tasks. Because it uses more than one dimension to partition the space, the BSP-Tree Process is more efficient and flexible than conventional axis-aligned cutting strategies. However, due to its batch learning setting, it is not well suited to large-scale classification and regression problems. In this paper, we develop an online BSP-Forest framework to address this limitation. With the arrival of new data, the resulting online algorithm can simultaneously expand the space coverage and refine the partition structure, with guaranteed universal consistency for both classification and regression problems. The effectiveness and competitive performance of the online BSP-Forest is verified via simulations on real-world datasets.
References in corpus (11)
- Scikit-learn: Machine Learning in Python
- Stochastic blockmodels and community structure in networks
- Gaussian Processes for Big Data
- Mondrian Forests: Efficient Online Random Forests
- Analysis of purely random forests bias
- Consistency of Online Random Forests
- The Binary Space Partitioning-Tree Process
- Rectangular Bounding Process
- Binary Space Partitioning Forests
- Bayesian Regression Tree Ensembles that Adapt to Smoothness and Sparsity
- The Mondrian Process for Machine Learning