On Smoothing Sparse Multinomial Data
Let \(p(i)\), \(i=1,...,m\), be multinomial cell probabilities for a given model, and \(\hat p(i)\) the corresponding cell proportion estimators (unsmoothed). A smoothed kernel estimator can be defined by employing information from neighbouring cells. The multinomial is sparse if (in asymptotic arguments) \(\sup_{i}p(i)\leq C\delta\), and \[ \sup_{i}| p(i+j)- \sum^{t-1}_{k=0} \binom{j}{k} \Delta^ kp(i)| \leq C\delta | j\delta |^ t, \] for some constant C and all j; these conditions are used to define a smoothness class \({\mathcal P}_ t\). Optimality of estimation procedures is judged by minimizing mean summed square error, e.g., \(\sum^{m}_{i=1}E\{\hat p(i)-p(i)\}^ 2.\) If the data is not too sparse \((n^{1/(2t+1)}\delta\) is bounded away from 0), then the optimal rate of convergence is that achieved by the unsmoothed cell proportions, namely \(0(n^{-1})\). Otherwise, the rate can be improved by smoothing. Explicit results, including formulae for the optimal smoothing parameter, are presented for a kernel-type estimator. The smoothing parameter is estimated from the data by ``least- squares cross-validation, in which one sample observation is omitted at a time, and the resulting procedure is shown to be asymptotically optimal.
- On the asymptotic properties of smoothed estimators of the classification error rate
- Evaluation of kernel density estimation methods for daily precipitation resampling
- On the performance of kernel estimators for high-dimensional, sparse binary data
- Smoothing sparse contingency tables: a graphical Bayesian approach
- Choosing the smoothing parameter for unordered multinomial data
- Multivariate nonparametric resampling scheme for generation of daily weather variables
- Sparse consistency and smoothing for multinomial data
- Smoothed bootstrap confidence intervals with discrete data
- On some testing problems for sparse contingency tables.
- On discrete Epanechnikov kernel functions
- Smoothing categorical data
- Adaptive Bayesian estimation of conditional discrete-continuous distributions with an application to stock market trading activity
- Estimating network degree distributions under sampling: an inverse problem, with applications to monitoring social media networks
- On the smoothing of multinomial estimates using Liouville mixture models and applications
- Nonparametric binary discrimination. Methods for estimating the smoothing para
- Relative smoothing of discrete distributions with sparse observations
- A minimum variance kernel estimator and a discrete frequency polygon estimator for ordinal contingency tables
- scientific article; zbMATH DE number 5177488 (Why is no real title available?)
- A prior-valued estimator applied to multinomial classification
- Kernel Estimates for Categorical Data
- scientific article; zbMATH DE number 4043074 (Why is no real title available?)
- Smoothing sparse multinomial data using local polynomial fitting
- Local Polynomial Estimation of Contingency Table Cell Probabilities
- Information estimators for weighted observations
- Local smoothing with given marginals
- Uniform in bandwidth consistency of kernel estimators of the density of mixed data
- Kernel smoothed probability mass functions for ordered datatypes
- Multinomial Probability Estimation by Wavelet Thresholding
- Central limit theorem for the total squared error of local polynomial estimators of cell probabilities
- Kernel density estimation: The general case
- Nonparametric estimation of the log odds ratio for sparse data by kernel smoothing
- Local polynomial fitting of an equipercentile equating function: uniform approximations
- Explicit-duration hidden Markov models for quantum state estimation
- Improving SAMC using smoothing methods: Theory and applications to Bayesian model selection problems
This page was built for publication: On Smoothing Sparse Multinomial Data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3765042)