Corpus ID: 211678099

Online Binary Space Partitioning Forests

@inproceedings{Fan2020OnlineBS,
  title={Online Binary Space Partitioning Forests},
  author={Xuhui Fan and Bin Li and Scott Anthony Sisson},
  booktitle={AISTATS},
  year={2020}
}
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… Expand
Baxter Permutation Process
TLDR
A Bayesian nonparametric model for Baxter permutations (BPs), termed BP process (BPP), is proposed and applied to relational data analysis and has a high affinity with Bayesian inference. Expand
Recurrent Dirichlet Belief Networks for Interpretable Dynamic Relational Data Modelling
TLDR
The extensive experiment results on real-world data validate the advantages of the Recurrent-DBN over the state-of-the-art models in interpretable latent structure discovery and improved link prediction performance. Expand
Bayesian Nonparametric Space Partitions: A Survey
TLDR
This survey investigates the current progress of BNSP research through the following three perspectives: models, which review various strategies for generating the partitions in the space and discuss their theoretical foundation `self-consistency'; applications, which cover the current mainstream usages of BnSP models and their potential future practises; and challenges, which identify the current unsolved problems and valuable future research topics. Expand

References

SHOWING 1-10 OF 47 REFERENCES
Binary Space Partitioning Forest
TLDR
This paper is the first attempt to extend the BSP-Tree process to a d-dimensional (d>2) space and proposes to generate a cutting hyperplane, which is assumed to be parallel to d-2 dimensions, to cut each node in the d- dimensional B SP-tree. Expand
Binary Space Partitioning Forests
TLDR
This paper is the first attempt to extend the BSP-Tree process to a d-dimensional (d>2) space and proposes to generate a cutting hyperplane, which is assumed to be parallel to d-2 dimensions, to cut each node in the d- dimensional B SP-tree. Expand
The Binary Space Partitioning-Tree Process
TLDR
This work proposes a self-consistent Binary Space Partitioning (BSP)-Tree process to generalize the Mondrian process, and uses Conditional-Sequential Monte Carlo for inference using the tree structure as the high-dimensional variable. Expand
Extremely randomized trees
TLDR
A new tree-based ensemble method for supervised classification and regression problems that consists of randomizing strongly both attribute and cut-point choice while splitting a tree node and builds totally randomized trees whose structures are independent of the output values of the learning sample. Expand
Random Tessellation Forests
TLDR
The Random Tessellation Process (RTP) is proposed, a framework that includes the Mondrian process and the binary space partitioning-tree process as special cases and can relax axis-aligned constraints, allowing complex inter-dimensional dependence to be captured. Expand
On-line Random Forests
TLDR
A novel on-line random forest algorithm is proposed that combines ideas from on-lines bagging, extremely randomized forests and propose an on- line decision tree growing procedure and adds a temporal weighting scheme for adaptively discarding some trees based on their out-of-bag-error in given time intervals and consequently growing of new trees. Expand
Minimax optimal rates for Mondrian trees and forests
Introduced by Breiman (2001), Random Forests are widely used as classification and regression algorithms. While being initially designed as batch algorithms, several variants have been proposed toExpand
Mondrian Forests: Efficient Online Random Forests
TLDR
Mondrian forests achieve competitive predictive performance comparable with existing online random forests and periodically retrained batch random forests, while being more than an order of magnitude faster, thus representing a better computation vs accuracy tradeoff. Expand
Rectangular Bounding Process
TLDR
A new parsimonious partition model -- the Rectangular Bounding Process (RBP) -- to efficiently partition multi-dimensional spaces, by employing a bounding strategy to enclose data points within rectangular bounding boxes. Expand
The Ostomachion Process
TLDR
The Ostomachion process (OP), which relaxes the cutting direction by allowing for oblique cuts, and the reversible-jump MCMC algorithm is adapted for inferring OP partition structures, which have validated the merit of the OP. Expand
...
1
2
3
4
5
...