Dirac mixture trees for fast suboptimal multi-dimensional density approximation.
Vesa KlumppUwe D. HanebeckPublished in: MFI (2008)
Keyphrases
- multi dimensional
- decision trees
- searching in metric spaces
- approximation error
- computationally efficient
- relative error
- closed form
- range queries
- multi dimensional data
- radon transform
- maximum error
- tree models
- approximation methods
- r tree
- error bounds
- mixture model
- bayesian networks
- sequential pattern mining
- leaf nodes
- queueing networks
- density function
- approximation algorithms
- tree construction
- sequential patterns
- low density