Access the full text.
Sign up today, get DeepDyve free for 14 days.
GR Terrell, DW Scott (1992)
Variable kernel density estimationAnn Stat, 20
S Richardson, PJ Green (1997)
On bayesian analysis of mixtures with an unknown number of components (with discussion)J R Stat Soc Ser B Stat Methodol, 59
C. Tsallis (1988)
Possible generalization of Boltzmann-Gibbs statisticsJournal of Statistical Physics, 52
J. Kapur, H. Kesavan (1992)
Entropy optimization principles with applications
J. Havrda, F. Charvát (1967)
Quantification method of classification processes. Concept of structural a-entropyKybernetika, 3
G. McLachlan, D. Peel (2000)
Finite Mixture Models
J. Borwein, A. Lewis (1991)
Duality relationships for entropy-like minimization problemsSiam Journal on Control and Optimization, 29
E. Jaynes (1957)
Information Theory and Statistical MechanicsPhysical Review, 106
Chris Jones, J. Marron, S. Sheather (1996)
Progress in data-based bandwidth selection for kernel density estimationComputational Statistics, 11
D. Titterington, A. Smith, U. Makov (1986)
Statistical analysis of finite mixture distributions
M. Wand, M. Jones (1995)
Kernel Smoothing
(1997)
Contribution to the discussion of paper by s
J. Marron (1985)
An Asymptotically Efficient Solution to the Bandwidth Problem of Kernel Density EstimationAnnals of Statistics, 13
P. Rousseeuw, A. Leroy (2005)
Wiley Series in Probability and Mathematical Statistics
H. Kesavan, J. Kapur (1989)
The generalized maximum entropy principleIEEE Trans. Syst. Man Cybern., 19
A. Bowman (1985)
A comparative study of some kernel-based nonparametric density estimatorsJournal of Statistical Computation and Simulation, 21
A. Decarreau, D. Hilhorst, C. Lemaréchal, J. Navaza (1992)
Dual Methods in Entropy Maximization. Application to Some Problems in CrystallographySIAM J. Optim., 2
J. Kapur (1992)
Maximum-entropy models in science and engineering
Jin Shin, Sang Kim (2006)
A Mathematical Theory of Communication
R. Rubinstein (2005)
A Stochastic Minimum Cross-Entropy Method for Combinatorial Optimization and Rare-event Estimation*Methodology and Computing in Applied Probability, 7
M. Jones, J. Marron, B. Park (1991)
A simple root n bandwidth selectorAnnals of Statistics, 19
Yuhai Wu (2021)
Statistical Learning TheoryTechnometrics, 41
G. Pan (1999)
Local Regression and LikelihoodTechnometrics, 42
S. Chib (1995)
Marginal Likelihood from the Gibbs OutputJournal of the American Statistical Association, 90
A. Izenman, Charles Sommer (1988)
Philatelic Mixtures and Multimodal DensitiesJournal of the American Statistical Association, 83
M. Wand (2001)
Local Regression and LikelihoodJournal of the American Statistical Association, 96
R. Rubinstein, Dirk Kroese (2004)
The Cross‐Entropy Method
Ping Zhang (1996)
Nonparametric Importance SamplingJournal of the American Statistical Association, 91
Z. Botev (2005)
Stochastic Methods for Optimization and Machine Learning
A. Bowman, P. Hall, D. Titterington (1984)
Cross-validation in nonparametric estimation of probabilities and probability densitiesBiometrika, 71
G. McLachlan, T. Krishnan (1996)
The EM algorithm and extensions
J. Borwein, A. Lewis (2000)
Convex Analysis And Nonlinear Optimization
J. Marron, M. Wand (1992)
EXACT MEAN INTEGRATED SQUARED ERRORAnnals of Statistics, 20
J. Simonoff (1996)
Multivariate Density Estimation
C. Loader (1999)
Bandwidth selection: classical or plug-in?Annals of Statistics, 27
H. Kile (2010)
Bandwidth Selection in Kernel Density Estimation
A. Ben-Tal, M. Teboulle (1987)
Penalty Functions and Duality in Stochastic Programming Via ϕ-Divergence FunctionalsMath. Oper. Res., 12
D. Ruppert, D. Cline (1994)
Bias reduction in kernel density estimation by smoothed empirical transformationsAnnals of Statistics, 22
F. Wan (1994)
Introduction To The Calculus of Variations And Its Applications
K. Basford, G. McLachlan, M. York (1997)
Modelling the distribution of stamp paper thickness via finite normal mixtures: The 1872 Hidalgo stamp issue of Mexico revisitedJournal of Applied Statistics, 24
C. Taylor, L. Devroye, L. Györfi (1985)
Nonparametric Density Estimation: The L 1 View., 148
Munirathnam Srikanth, H. Kesavan, P. Roe (2000)
Probability density function estimation using the MinMax measureIEEE Trans. Syst. Man Cybern. Part C, 30
E. Lehmann (1990)
Model Specification: The Views of Fisher and Neyman, and Later DevelopmentsStatistical Science, 5
Lawrence Laboratory, Lindsay Schachinger (1994)
Summary of the
R. Sauter (2002)
In All LikelihoodTechnometrics, 44
J. Simonoff (1998)
Smoothing Methods in Statistics
K. Roeder (1990)
Density estimation with confidence sets exemplified by superclusters and voids in the galaxiesJournal of the American Statistical Association, 85
D. Scott (2001)
Parametric Statistical Modeling by Minimum Integrated Square ErrorTechnometrics, 43
A. Doucet, Nando Freitas, N. Gordon (2001)
Sequential Monte Carlo Methods in Practice
JM Borwein, AS Lewis (2000)
Convex analysis and nonlinear optimization: theory and examples
Deniz Erdoğmuş, J. Príncipe (2002)
An error-entropy minimization algorithm for supervised training of nonlinear adaptive systemsIEEE Trans. Signal Process., 50
Bernard Silverman (1987)
Density Estimation for Statistics and Data Analysis
Chao He, M. Girolami (2004)
Novelty detection employing an L2 optimal non-parametric density estimatorPattern Recognit. Lett., 25
P. Hall, B. Turlach (1999)
Reducing bias in curve estimation by use of weightsComputational Statistics & Data Analysis, 30
J. Kapur, H. Kesavan (1992)
Entropy Optimization Principles and Their Applications
Y. Pawitan (2002)
In all likelihood : statistical modelling and inference using likelihoodThe Mathematical Gazette, 86
P. Hall (1987)
On Kullback-Leibler loss and density estimationAnnals of Statistics, 15
J. Hammersley (1982)
SIMULATION AND THE MONTE CARLO METHODBulletin of The London Mathematical Society, 14
(1997)
Contribution to the discussion of paper by s. richardson and p.j.green
Huaiyu Zhu (1997)
On Information and Sufficiency
Shean-Tsong Chiu (1991)
Bandwidth selection for kernel density estimationAnnals of Statistics, 19
S. Mukherjee, V. Vapnik (1999)
Multivariate Density Estimation: a Support Vector Machine Approach
Ian Abramson (1982)
On Bandwidth Variation in Kernel Estimates-A Square Root LawAnnals of Statistics, 10
R. Rubinstein (1981)
Simulation and the Monte Carlo method
M Girolami, C He (2004)
Novelty detection employing an l 2 optimal non-parametric density estimatorPattern Recogn Lett, 25
I. Csiszár (1972)
A class of measures of informativity of observation channelsPeriodica Mathematica Hungarica, 2
C. Stone (1984)
An Asymptotically Optimal Window Selection Rule for Kernel Density EstimatesAnnals of Statistics, 12
D. Scott (1992)
Multivariate Density Estimation, Theory, Practice and VisualizationThe Statistician, 43
M. Girolami, Chao He (2003)
Probability Density Estimation from Optimally Condensed Data SamplesIEEE Trans. Pattern Anal. Mach. Intell., 25
R. Morejon, J. Príncipe (2004)
Advanced search algorithms for information-theoretic learning with kernel-based estimatorsIEEE Transactions on Neural Networks, 15
M. Hazelton (2003)
Variable kernel density estimationAustralian & New Zealand Journal of Statistics, 45
Stephen Boyd, L. Vandenberghe (2005)
Convex OptimizationJournal of the American Statistical Association, 100
Z. Botev, Dirk Kroese (2008)
Non-asymptotic Bandwidth Selection for Density Estimation of Discrete DataMethodology and Computing in Applied Probability, 10
J. Kapur (1994)
Measures of information and their applications
C. Biernacki, G. Celeux, G. Govaert (1998)
Assessing a Mixture Model for Clustering with the Integrated Classification Likelihood
L Devroye, L Gyofri (1985)
Nonparametric density estimation: the L 1 view
L. Devroye, L. Györfi (1987)
Nonparametric density estimation : the L[1] viewJournal of the American Statistical Association, 82
G. Celeux, Gilda Soromenho (1996)
An entropy criterion for assessing the number of clusters in a mixture modelJournal of Classification, 13
J. Kapur, H. Kesavan (1987)
The generalized maximum entropy principle (with applications)
Nonparametric density estimation aims to determine the sparsest model that explains a given set of empirical data and which uses as few assumptions as possible. Many of the currently existing methods do not provide a sparse solution to the problem and rely on asymptotic approximations. In this paper we describe a framework for density estimation which uses information-theoretic measures of model complexity with the aim of constructing a sparse density estimator that does not rely on large sample approximations. The effectiveness of the approach is demonstrated through an application to some well-known density estimation test cases.
Methodology and Computing in Applied Probability – Springer Journals
Published: May 16, 2009
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.