Learning as Data Compression

DOI10.1007/978-3-540-73001-9_2zbMath1151.68435OpenAlexW1494926127MaRDI QIDQ5426861

Pieter Adriaans

Publication date: 13 November 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73001-9_2

zbMATH Keywords

MDLrandomness deficiencylearning as compressiontwo-part code optimizationDFA induction

Mathematics Subject Classification ID

Computational learning theory (68Q32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (1)

Face Representations via Tensorfaces of Various Complexities

This page was built for publication: Learning as Data Compression