On stochastic complexity and nonparametric density estimation
From MaRDI portal
Publication:3810684
DOI10.1093/biomet/75.4.705zbMath0661.62025OpenAlexW2055665704MaRDI QIDQ3810684
Publication date: 1988
Published in: Biometrika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/biomet/75.4.705
model selectiondata analysisAkaike information criterionasymptotic resultskernel estimatorminimum description lengthpenalized likelihoodstochastic complexitymodel fittinghistogram estimatordata based criteriaoptimal side width of congruent cubes
Related Items
Density estimation for time series by histograms, An Introduction to Coding Theory and the Two-Part Minimum Description Length Principle, Schwarz, Wallace, and Rissanen: Intertwining Themes in Theories of Model Selection, On histograms for linear processes, Test for homogeneity of several populations by stochastic complexity, Bin width selection in multivariate histograms by the combinatorial method, Fast and fully-automated histograms for large-scale data sets, Data driven versions of pearson's chisquare test for uniformity, Histograms for stationary linear random fields, Data driven versions of neyman's test for uniformity based on bayesian rule, Fluctuation-Dissipation Theorem and Models of Learning, Data compression and histograms, How Many Clusters? An Information-Theoretic Perspective, Predictability, Complexity, and Learning, How many bins should be put in a regular histogram, Regression spline smoothing using the minimum description length principle, On the computation of entropy prior complexity and marginal prior distribution for the Bernoulli model, A comparison of automatic histogram constructions, Detecting and evaluating intrinsic nonlinearity present in the mutual dependence between two variables