scientific article
From MaRDI portal
zbMath0668.94005MaRDI QIDQ3822087
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Interpreting uninterpretable predictors: kernel methods, Shtarkov solutions, and random forests, Information optimality and Bayesian modelling, High-dimensional penalty selection via minimum description length principle, Graph Summarization with Latent Variable Probabilistic Models, A linear-time algorithm for computing the multinomial stochastic complexity, Using the Bayesian Shtarkov solution for predictions, Stochastic complexity in learning, On model selection, Bayesian networks, and the Fisher information integral, Fast and fully-automated histograms for large-scale data sets, Sequential network change detection with its applications to ad impact relation analysis, Some Sufficient Conditions on an Arbitrary Class of Stochastic Processes for the Existence of a Predictor, The decomposed normalized maximum likelihood code-length criterion for selecting hierarchical latent variable models, Hierarchical two-part MDL code for multinomial distributions, Unnamed Item, Unnamed Item, Jeffreys versus Shtarkov distributions associated with some natural exponential families, Individual redundancy of adaptive and weighted source coding, Universal coding algorithm for a family of context Markov sources, Model selection by sequentially normalized least squares, Model selection by normalized maximum likelihood, Minimum message length inference of the Poisson and geometric models using heavy-tailed prior distributions, Price probabilities: a class of Bayesian and non-Bayesian prediction rules, On some properties of the NML estimator for Bernoulli strings, NML, Bayes and true distributions: a comment on Karabatsos and Walker (2006), Minimum description length revisited, Robust subgroup discovery. Discovering subgroup lists using MDL, Universal coding for memoryless sources with countably infinite alphabets
