Stochastic Patching Process

05/23/2016
by   Xuhui Fan, et al.
0

Stochastic partition models tailor a product space into a number of rectangular regions such that the data within each region exhibit certain types of homogeneity. Due to constraints of partition strategy, existing models may cause unnecessary dissections in sparse regions when fitting data in dense regions. To alleviate this limitation, we propose a parsimonious partition model, named Stochastic Patching Process (SPP), to deal with multi-dimensional arrays. SPP adopts an "enclosing" strategy to attach rectangular patches to dense regions. SPP is self-consistent such that it can be extended to infinite arrays. We apply SPP to relational modeling and the experimental results validate its merit compared to the state-of-the-arts.

READ FULL TEXT
research
03/10/2019

Rectangular Bounding Process

Stochastic partition models divide a multi-dimensional space into a numb...
research
03/19/2023

Sparse Partial-Tracing

Matrices and more generally multidimensional arrays, form the backbone o...
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
09/09/2016

Automatic Selection of Stochastic Watershed Hierarchies

The segmentation, seen as the association of a partition with an image, ...
research
10/11/2021

Density-based interpretable hypercube region partitioning for mixed numeric and categorical data

Consider a structured dataset of features, such as {SEX, INCOME, RACE, E...
research
10/31/2014

Partition-wise Linear Models

Region-specific linear models are widely used in practical applications ...
research
05/19/2018

Free-rider Episode Screening via Dual Partition Model

One of the drawbacks of frequent episode mining is that overwhelmingly m...

Please sign up or login with your details

Forgot password? Click here to reset