Non-asymptotic bandwidth selection for density estimation of discrete data
DOI10.1007/s11009-007-9057-zzbMath1177.94109OpenAlexW2037104003WikidataQ56157775 ScholiaQ56157775MaRDI QIDQ1042539
Dirk P. Kroese, Zdravko I. Botev
Publication date: 14 December 2009
Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11009-007-9057-z
kernel density estimatorbandwidth selectionstatistical modelinggeneralized cross entropydiscrete data smoothingmultivariate binary discrimination
Computational learning theory (68Q32) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Data smoothing in stochastic control theory (93E14) Measures of information, entropy (94A17)
Related Items
Uses Software
Cites Work
- A Mathematical Theory of Communication
- The transform likelihood ratio method for rare event simulation with heavy tails
- The generalized cross entropy method, with applications to probability density estimation
- An asymptotically optimal window selection rule for kernel density estimates
- Progress in data-based bandwidth selection for kernel density estimation
- Smoothing categorical data
- Possible generalization of Boltzmann-Gibbs statistics.
- Bandwidth selection: Classical or plug-in?
- A stochastic minimum cross-entropy method for combinatorial optimization and rare-event estimation
- Information Theory and Statistical Mechanics
- A comparative study of some kernel-based nonparametric density estimators
- Semiparametric smoothing for discrete data
- A Comparative Study of Kernel-Based Density Estimates for Categorical Data
- On nonparametric multivariate binary discrimination
- Multivariate binary discrimination by the kernel method
- On Information and Sufficiency
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
