Stochastic complexity in learning

DOI10.1006/JCSS.1997.1501MaRDI QIDQ1370860zbMATH OpenOpenAlexFDO

Authors J. Ning

Publication date 25 May 1998

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jcss.1997.1501

zbMATH Keywords

MDL decision treesstochastic complexity

Mathematics Subject Classification ID

Data structures (68P05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Stochastic complexity and the mdl principle
• scientific article; zbMATH DE number 4068049
• scientific article; zbMATH DE number 3971958
• A linear-time algorithm for computing the multinomial stochastic complexity
• A decision-theoretic extension of stochastic complexity and its applications to learning

Cites work

• A formal theory of inductive inference. Part I
• A learning criterion for stochastic rules
• A network of autoregressive processing units for time series modeling
• A universal finite memory source
• Fisher information and stochastic complexity
• scientific article; zbMATH DE number 994737 (Why is no real title available?)
• scientific article; zbMATH DE number 3427210 (Why is no real title available?)
• scientific article; zbMATH DE number 4095371 (Why is no real title available?)
• scientific article; zbMATH DE number 45100 (Why is no real title available?)
• Inferring decision trees using the minimum description length principle
• On the Length of Programs for Computing Finite Binary Sequences
• On the Length of Programs for Computing Finite Binary Sequences
• Stochastic complexity and modeling
• The performance of universal encoding
• Universal coding, information, prediction, and estimation
• Universal noiseless coding

Cited in

(23)

• A learning criterion for stochastic rules
• Failure-time prediction
• Bayesian predictiveness, exchangeability and sufficientness in bacterial taxonomy
• On the stochastic complexity of learning realizable and unrealizable rules
• A network of autoregressive processing units for time series modeling
• A latent class MDS model with spatial constraints for non-stationary spatial covariance estimation
• Unsupervised learning of pharmacokinetic responses
• Rademacher Chaos Complexities for Learning the Kernel Problem
• scientific article; zbMATH DE number 994737 (Why is no real title available?)
• Stochastic Decision Theory
• scientific article; zbMATH DE number 4068049 (Why is no real title available?)
• Learning decision trees with stochastic linear classifiers
• scientific article; zbMATH DE number 218676 (Why is no real title available?)
• A decision-theoretic extension of stochastic complexity and its applications to learning
• An Introduction to Coding Theory and the Two-Part Minimum Description Length Principle
• Probabilistic Models for Bacterial Taxonomy
• Stochastic correlative learning algorithms
• scientific article; zbMATH DE number 2217750 (Why is no real title available?)
• Stochastic complexity and the mdl principle
• Theory and Applications of Models of Computation
• Aspects of complexity of probabilistic learning under monotonicity constraints
• Learning genetic population structures using minimization of stochastic complexity
• A dual latent class unfolding model for two-way two-mode preference rating data

This page was built for publication: Stochastic complexity in learning

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