Publication:3800883
From MaRDI portal
zbMath0654.62008MaRDI QIDQ3800883
Publication date: 1987
utility function; model selection criteria; prior knowledge; stochastic complexity; minimum code length; optimal models; amount of uncertainty; asymptotically sufficient statistics; greatest lower bound for prediction errors; learning from observed data; parametric class of probabilistic models
Related Items
The lob-pass problem, Determining the number of components in mixtures of linear models., A comparison of automatic histogram constructions, Bayesian unsupervised classification framework based on stochastic partitions of data and a parallel search strategy, The max-min hill-climbing Bayesian network structure learning algorithm, Bayesian model learning based on predictive entropy, Minimum message length estimation using EM methods: a case study, AR order selection in the case when the model parameters are estimated by forgetting factor least-squares algorithms, Akaike's information criterion and Kullback-Leibler loss for histogram density estimation, A game of prediction with expert advice, Stochastic complexity and model selection from incomplete data, On Rissanen's predictive stochastic complexity for stationary ARMA processes, Recognition, Learning about the parameter of the Bernoulli model, On-line maximum likelihood prediction with respect to general loss functions, Classification of binary vectors by stochastic complexity., Applying MDL to learn best model granularity, Bayesian predictiveness, exchangeability and sufficientness in bacterial taxonomy, The exchangeable multinomial model as an approach to testing deterministic axioms of choice and measurement, A consistent model selection procedure for Markov random fields based on penalized pseudolikelihood, Selecting optimal multistep predictors for autoregressive processes of unknown order., Entropy, divergence and distance measures with econometric applications, Akaike's information criterion and recent developments in information complexity, Model selection based on minimum description length, A linear-time algorithm for computing the multinomial stochastic complexity, `Ideal learning' of natural language: positive results about learning from positive evidence, A generalization of BIC for the general exponential family, Accumulative prediction error and the selection of time series models, Model selection by normalized maximum likelihood, Model selection for the rate problem: a comparison of significance testing, Bayesian and minimum description length statistical inference, A Tutorial on Learning with Bayesian Networks
