Stochastic complexity in learning
type: Item
instance of: scholarly article
title: Stochastic complexity in learning
zbMATH Open document ID: 0887.68039
author: J. Ning
published in: Journal of Computer and System Sciences
publication date: 1998-05-25T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 1079983
zbMATH Keywords: stochastic complexity
zbMATH Keywords: MDL decision trees
MaRDI profile type: Publication
full work available at URL: jcss.1997.1501
OpenAlex ID: W2081398938
cites work: On the Length of Programs for Computing Finite Binary Sequences
cites work: Universal noiseless coding
cites work: Q3214803
cites work: The performance of universal encoding
cites work: A network of autoregressive processing units for time series modeling
cites work: Inferring decision trees using the minimum description length principle
cites work: Universal coding, information, prediction, and estimation
cites work: Stochastic complexity and modeling
cites work: Q3995624
cites work: Q3126568
cites work: Fisher information and stochastic complexity
cites work: Q3822087
cites work: A formal theory of inductive inference. Part I
cites work: A learning criterion for stochastic rules
cites work: A universal finite memory source
DOI: 10.1006/JCSS.1997.1501
description: scientific article; zbMATH DE number 1079983