Regularized tessellation density estimation with bootstrap aggregation and complexity penalization

Authors:
Matthew Browne
Affiliations:
School of Health and Human Services, Faculty of Sciences, Engineering and Health, Central Queensland University, QLD, Australia
Venue:
Pattern Recognition
Year:
2012

Citing 10
Cited 0

Voronoi diagrams—a survey of a fundamental geometric data structure

ACM Computing Surveys (CSUR)
Bagging predictors

Machine Learning
VRONI: an engineering approach to the reliable and efficient computation of voronoi diagrams of points and line segments

Computational Geometry: Theory and Applications
An Empirical Comparison of Voting Classification Algorithms: Bagging, Boosting, and Variants

Machine Learning
Multivariate locally adaptive density estimation

Computational Statistics & Data Analysis
Kernel density estimation with adaptive varying window size

Pattern Recognition Letters
A geometric approach to non-parametric density estimation

Pattern Recognition
Clustering via nonparametric density estimation

Statistics and Computing
An empirical evaluation of bagging and boosting

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Modern Applied Statistics with S

Modern Applied Statistics with S

Quantified Score

Hi-index	0.01

Visualization

Abstract

Locally adaptive density estimation presents challenges for parametric or non-parametric estimators. Several useful properties of tessellation density estimators (TDEs), such as low bias, scale invariance and sensitivity to local data morphology, make them an attractive alternative to standard kernel techniques. However, simple TDEs are discontinuous and produce highly unstable estimates due to their susceptibility to sampling noise. With the motivation of addressing these concerns, we propose applying TDEs within a bootstrap aggregation algorithm, and incorporating model selection with complexity penalization. We implement complexity reduction of the TDE via sub-sampling, and use information-theoretic criteria for model selection, which leads to an automatic and approximately ideal bias/variance compromise. The procedure yields a stabilized estimator that automatically adapts to the complexity of the generating distribution and the quantity of information at hand, and retains the highly desirable properties of the TDE. Simulation studies presented suggest a high degree of stability and sensitivity can be obtained using this approach.