scientific article

From MaRDI portal
Revision as of 15:34, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3822087

zbMath0668.94005MaRDI QIDQ3822087

Yu. M. Shtar'kov

Publication date: 1987


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (27)

Interpreting uninterpretable predictors: kernel methods, Shtarkov solutions, and random forestsInformation optimality and Bayesian modellingHigh-dimensional penalty selection via minimum description length principleGraph Summarization with Latent Variable Probabilistic ModelsA linear-time algorithm for computing the multinomial stochastic complexityUsing the Bayesian Shtarkov solution for predictionsStochastic complexity in learningOn model selection, Bayesian networks, and the Fisher information integralFast and fully-automated histograms for large-scale data setsSequential network change detection with its applications to ad impact relation analysisSome Sufficient Conditions on an Arbitrary Class of Stochastic Processes for the Existence of a PredictorThe decomposed normalized maximum likelihood code-length criterion for selecting hierarchical latent variable modelsHierarchical two-part MDL code for multinomial distributionsUnnamed ItemUnnamed ItemJeffreys versus Shtarkov distributions associated with some natural exponential familiesIndividual redundancy of adaptive and weighted source codingUniversal coding algorithm for a family of context Markov sourcesModel selection by sequentially normalized least squaresModel selection by normalized maximum likelihoodMinimum message length inference of the Poisson and geometric models using heavy-tailed prior distributionsPrice probabilities: a class of Bayesian and non-Bayesian prediction rulesOn some properties of the NML estimator for Bernoulli stringsNML, Bayes and true distributions: a comment on Karabatsos and Walker (2006)Minimum description length revisitedRobust subgroup discovery. Discovering subgroup lists using MDLUniversal coding for memoryless sources with countably infinite alphabets




This page was built for publication: