Explanatory and creative alternatives to the MDL principle
From MaRDI portal
Recommendations
Cites work
- A formal model of hierarchical concept learning
- A formal theory of inductive inference. Part II
- A Machine-Independent Theory of the Complexity of Recursive Functions
- A theory of the learnable
- An Information Measure for Classification
- Comparison of identification criteria for machine inductive inference
- Complexity-based induction
- Complexity-based induction systems: Comparisons and convergence theorems
- Constructive reinforcement learning
- Fisher information and stochastic complexity
- scientific article; zbMATH DE number 96338 (Why is no real title available?)
- scientific article; zbMATH DE number 1010621 (Why is no real title available?)
- scientific article; zbMATH DE number 3417428 (Why is no real title available?)
- Inductive Logic Programming: Theory and methods
- Inferring decision trees using the minimum description length principle
- Language identification in the limit
- Learnability and the Vapnik-Chervonenkis dimension
- Model selection based on minimum description length
- Modeling by shortest data description
- On the intrinsic complexity of learning
- On the necessity of Occam algorithms
- Queries and concept learning
- Stochastic complexity and modeling
- The minimum description length principle in coding and modeling
- Toward a mathematical theory of inductive inference
- Universal prediction
Cited in
(2)
This page was built for publication: Explanatory and creative alternatives to the MDL principle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5938216)