• Media type: E-Article
  • Title: Density estimation with distribution element trees
  • Contributor: Meyer, Daniel W. [Author]
  • imprint: Springer, 2018-05
  • Published in: Statistics and Computing, 28 (3)
  • Language: English
  • DOI: https://doi.org/20.500.11850/168068; https://doi.org/10.3929/ethz-b-000168068; https://doi.org/10.1007/s11222-017-9751-9
  • Keywords: Adaptive binning ; Big data ; Density estimation tree ; High dimensional ; Mathematics ; Curse of dimensionality ; Pólya tree ; Kernel density estimation ; Polynomial histogram ; Adaptive histogram ; Nonparametric density estimation
  • Origination:
  • Footnote: Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
  • Description: The estimation of probability densities based on available data is a central task in many statistical applications. Especially in the case of large ensembles with many samples or high-dimensional sample spaces, computationally efficient methods are needed. We propose a new method that is based on a decomposition of the unknown distribution in terms of so-called distribution elements (DEs). These elements enable an adaptive and hierarchical discretization of the sample space with small or large elements in regions with smoothly or highly variable densities, respectively. The novel refinement strategy that we propose is based on statistical goodness-of-fit and pairwise (as an approximation to mutual) independence tests that evaluate the local approximation of the distribution in terms of DEs. The capabilities of our new method are inspected based on several examples of different dimensionality and successfully compared with other state-of-the-art density estimators. ; ISSN:0960-3174 ; ISSN:1573-1375
  • Access State: Open Access
  • Rights information: In Copyright - Non-commercial Use Permitted