On stochastic complexity estimation: a decision-theoretic approach

DOI10.1109/18.335957MaRDI QIDQ4324180zbMATH OpenOpenAlexFDO

Authors Guoqi Qian, George Gabor, R. P. Gupta

Publication date 1 March 1995

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.335957

zbMATH Keywords

complexity decision rulestochastic complexity

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• On stochastic complexity and nonparametric density estimation
• Density estimation by stochastic complexity
• Some notes on Rissanen's stochastic complexity
• scientific article; zbMATH DE number 4068049
• Minimum complexity density estimation

Cited in

(9)

• A linear-time algorithm for computing the multinomial stochastic complexity
• On stochastic complexity and nonparametric density estimation
• Minimum complexity density estimation
• Density estimation by stochastic complexity
• Some notes on Rissanen's stochastic complexity
• scientific article; zbMATH DE number 218676 (Why is no real title available?)
• A decision-theoretic extension of stochastic complexity and its applications to learning
• Stochastic complexity, histograms and hypothesis testing of homogeneity
• The hardness of the expected decision depth problem

This page was built for publication: On stochastic complexity estimation: a decision-theoretic approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4324180)