Rectangular Bounding Process

03/10/2019
by   Xuhui Fan, et al.
0

Stochastic partition models divide a multi-dimensional space into a number of rectangular regions, such that the data within each region exhibit certain types of homogeneity. Due to the nature of their partition strategy, existing partition models may create many unnecessary divisions in sparse regions when trying to describe data in dense regions. To avoid this problem we introduce 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. Unlike existing approaches, the RBP possesses several attractive theoretical properties that make it a powerful nonparametric partition prior on a hypercube. In particular, the RBP is self-consistent and as such can be directly extended from a finite hypercube to infinite (unbounded) space. We apply the RBP to regression trees and relational models as a flexible partition prior. The experimental results validate the merit of the RBP in rich yet parsimonious expressiveness compared to the state-of-the-art methods.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/23/2016

Stochastic Patching Process

Stochastic partition models tailor a product space into a number of rect...
research
10/18/2016

Using Centroidal Voronoi Tessellations to Scale Up the Multi-dimensional Archive of Phenotypic Elites Algorithm

The recently introduced Multi-dimensional Archive of Phenotypic Elites (...
research
03/22/2019

Binary Space Partitioning Forests

The Binary Space Partitioning (BSP)-Tree process is proposed to produce ...
research
08/05/2021

Shape Modeling with Spline Partitions

Shape modelling (with methods that output shapes) is a new and important...
research
02/26/2020

Bayesian Nonparametric Space Partitions: A Survey

Bayesian nonparametric space partition (BNSP) models provide a variety o...
research
06/27/2012

On the Partition Function and Random Maximum A-Posteriori Perturbations

In this paper we relate the partition function to the max-statistics of ...
research
06/24/2008

Conceptualization of seeded region growing by pixels aggregation. Part 3: a wide range of algorithms

In the two previous papers of this serie, we have created a library, cal...

Please sign up or login with your details

Forgot password? Click here to reset