Stochastic complexity in learning

DOI10.1006/jcss.1997.1501zbMath0887.68039OpenAlexW2081398938MaRDI QIDQ1370860

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

stochastic complexityMDL decision trees

Mathematics Subject Classification ID

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

Related Items (9)

Unsupervised learning of pharmacokinetic responses ⋮ A network of autoregressive processing units for time series modeling ⋮ An Introduction to Coding Theory and the Two-Part Minimum Description Length Principle ⋮ Probabilistic Models for Bacterial Taxonomy ⋮ Learning genetic population structures using minimization of stochastic complexity ⋮ A dual latent class unfolding model for two-way two-mode preference rating data ⋮ A latent class MDS model with spatial constraints for non-stationary spatial covariance estimation ⋮ Failure-time prediction ⋮ Bayesian predictiveness, exchangeability and sufficientness in bacterial taxonomy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stochastic complexity and modeling
• Inferring decision trees using the minimum description length principle
• A learning criterion for stochastic rules
• A network of autoregressive processing units for time series modeling
• Universal coding, information, prediction, and estimation
• The performance of universal encoding
• Universal noiseless coding
• A universal finite memory source
• Fisher information and stochastic complexity
• On the Length of Programs for Computing Finite Binary Sequences
• On the Length of Programs for Computing Finite Binary Sequences
• A formal theory of inductive inference. Part I

This page was built for publication: Stochastic complexity in learning