Best Probability Density Function for Random Sampled Data
Open Access
- 4 December 2009
- Vol. 11 (4) , 1001-1024
Abstract
The maximum entropy method is a theoretically sound approach to construct an analytical form for the probability density function (pdf) given a sample of random events. In practice, numerical methods employed to determine the appropriate Lagrange multipliers associated with a set of moments are generally unstable in the presence of noise due to limited sampling. A robust method is presented that always returns the best pdf, where tradeoff in smoothing a highly varying function due to noise can be controlled. An unconventional adaptive simulated annealing technique, called funnel diffusion, determines expansion coefficients for Chebyshev polynomials in the exponential function.Keywords
This publication has 18 references indexed in Scilit:
- Hausdorff moment problem: Reconstruction of probability density functionsStatistics & Probability Letters, 2008
- A statistical minimax approach to the Hausdorff moment problemInverse Problems, 2008
- Quantifying predictability through information theory: small sample estimation in a non-Gaussian frameworkJournal of Computational Physics, 2005
- Maximum entropy and the problem of moments: A stable algorithmPhysical Review E, 2005
- Why Least Squares and Maximum Entropy? An Axiomatic Approach to Inference for Linear Inverse ProblemsThe Annals of Statistics, 1991
- On the convergence of moment problemsTransactions of the American Mathematical Society, 1991
- A maximum-entropy approach to the density of states within the recursion methodJournal of Physics C: Solid State Physics, 1988
- Maximum Entropy and the Method of Moments in Performance Evaluation of Digital Communications SystemsIEEE Transactions on Communications, 1986
- Maximum entropy histogramsJournal of Physics A: General Physics, 1977
- Information Theory and Statistical MechanicsPhysical Review B, 1957