Abstract
In this paper we consider logspline density estimation for binned data. Rates of convergence are established when the log-density function is assumed to be in a Besov space. An algorithm involving a procedure similar to maximum likelihood, stepwise knot addition, and stepwise knot deletion is proposed for the estimation of the density function based upon binned data. Numerical examples are used to show the finite-sample performance of inference based on the logspline density estimation.
| Original language | English |
|---|---|
| Pages (from-to) | 133-147 |
| Number of pages | 15 |
| Journal | Statistics and Probability Letters |
| Volume | 46 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 2000 Jan 15 |
| Externally published | Yes |
Keywords
- Besov space
- Binning
- Knot selection
- MILE
- Optimal rate of convergence
ASJC Scopus subject areas
- Statistics and Probability
- Statistics, Probability and Uncertainty