Density estimation through convex combinations of densities: Approximation and estimation bounds
From MaRDI portal
Publication:676599
DOI10.1016/S0893-6080(96)00037-8zbMath0869.68094WikidataQ73186798 ScholiaQ73186798MaRDI QIDQ676599
Publication date: 18 March 1997
Published in: Neural Networks (Search for Journal in Brave)
68T10: Pattern recognition, speech recognition
Related Items
Density estimation by the penalized combinatorial method, Modeling nonlinearities with mixtures-of-experts of time series models, Modelling nonlinear count time series with local mixtures of Poisson autoregressions, Hierarchical mixtures-of-experts for exponential family regression models: Approximation and maximum likelihood estimation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonparametric maximum likelihood estimation by the method of sieves
- Approximation of density functions by sequences of exponential families
- Asymptotics in statistics: some basic concepts
- Approximation and estimation bounds for artificial neural networks
- Mixture Densities, Maximum Likelihood and the EM Algorithm
- Consequences and Detection of Misspecified Nonlinear Regression Models
- Minimum complexity density estimation
- Universal approximation bounds for superpositions of a sigmoidal function
- Adaptive Mixtures
- Maximum Likelihood Estimation of Misspecified Models