Density estimation by the penalized combinatorial method
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4170917 (Why is no real title available?)
- scientific article; zbMATH DE number 3731128 (Why is no real title available?)
- scientific article; zbMATH DE number 17222 (Why is no real title available?)
- scientific article; zbMATH DE number 597901 (Why is no real title available?)
- scientific article; zbMATH DE number 1085980 (Why is no real title available?)
- scientific article; zbMATH DE number 1096538 (Why is no real title available?)
- scientific article; zbMATH DE number 194758 (Why is no real title available?)
- scientific article; zbMATH DE number 4001210 (Why is no real title available?)
- scientific article; zbMATH DE number 3446442 (Why is no real title available?)
- scientific article; zbMATH DE number 765034 (Why is no real title available?)
- scientific article; zbMATH DE number 893887 (Why is no real title available?)
- scientific article; zbMATH DE number 1391397 (Why is no real title available?)
- scientific article; zbMATH DE number 6791314 (Why is no real title available?)
- A Note on Density Model Size Testing
- A distribution-free theory of nonparametric regression
- A note on penalized minimum distance estimation in nonparametric regression
- Adaptive Mixtures
- Approximation of density functions by sequences of exponential families
- Central limit theorems for empirical measures
- Combinatorial methods in density estimation
- Computational and Inferential Difficulties with Mixture Posterior Distributions
- Consistent estimation of mixture complexity.
- Density estimation through convex combinations of densities: Approximation and estimation bounds
- Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
- Finite mixture models
- Large-sample inference for log-spline models
- Likelihood ratio of unidentifiable models and multilayer neural networks
- Mixture Densities, Maximum Likelihood and the EM Algorithm
- Nonparametric regression function estimation using interaction least squares splines and complexity regularization.
- On the Bayes-risk consistency of regularized boosting methods.
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Practical Bayesian Density Estimation Using Mixtures of Normals
- Rates of convergence of minimum distance estimators and Kolmogorov's entropy
- Risk bounds for model selection via penalization
- Some applications of concentration inequalities to statistics
- Statistical analysis of finite mixture distributions
- Sélection d'histogrammes à l'aide d'un critère de type Akaike
- Testing in locally conic models, and application to mixture models
- Testing the order of a model using locally conic parametrization: Population mixtures and stationary ARMA processes
- The estimation of the order of a mixture model
- Universal smoothing factor selection in density estimation: theory and practice. (With discussion)
Cited in
(12)- A note on penalized minimum distance estimation in nonparametric regression
- A Note on Density Model Size Testing
- Density estimation via exponential model selection
- The penalized profile sampler
- Strongly consistent model selection for densities
- Penalized log-density estimation using Legendre polynomials
- Post-model-selection method for density estimation
- Parametric estimation and tests through divergences and the duality technique
- A note on minimum distance estimation of copula densities
- Adaptive log-density estimation
- SPADES and mixture models
- Density estimation with stagewise optimization of the empirical risk
This page was built for publication: Density estimation by the penalized combinatorial method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q558002)
