References

1

Geoffrey E. Hinton and Richard S. Zemel.
Autoencoders, minimum description length and Helmholz free energy.
In Jack D. Cowan, Gerald Tesauro, and Joshua Alspector, editors, NIPS 6, pages 3-10, San Francisco, 1994. Morgan Kaufmann.

2

Sepp Hochreiter and Jürgen Schmidhuber.
Flat minima.
Neural Computation, 9(1):1-42, January 1997.

3

Bernhard Pfahringer.
Compression-based feature subset selection.
In P. Turney, editor, IJCAI-95 Workshop on Data Engineering for Inductive Learning. IJCAI-95 Workshop Program Working Notes, Montreal, Canada, 1995.

4

Jorma Rissanen.
Modeling by shortest data description.
Automatica, 14:465-471, 1978.

5

Jorma Rissanen.
A universal prior for integers and estimation by minimum description length.
Annals of Statistics, 11(2):416-431, 1983.

6

Jorma Rissanen.
Stochastic complexity.
Journal of the Royal Statistical Society (Series B), 49(3):223-239 and 252-265, 1987.

7

Jorma Rissanen.
Fisher information and stochastic complexity.
IEEE Transactions on Information Theory, 42(1):40-47, January 1996.

8

Jorma Rissanen and G. G. Langdon, Jr.
Universal modeling and coding.
IEEE Transactions on Information Theory, 27:12-23, 1981.

9

Claude E. Shannon.
A mathematical theory of communication.
Bell System Technical Journal, 27:379-423, July 1948.

10

C. S. Wallace and D. M. Boulton.
An information measure for classification.
Computer Journal, 11(2):185-194, 1968.

11

C. S. Wallace and P. R. Freeman.
Estimation and inference by compact coding.
Journal of the Royal Statistical Society (Series B), 49(3):240-265, 1987.

12

Richard S. Zemel.
A minimum description length framework for unsupervised learning.
PhD thesis, University of Toronto, Canada, 1993.

13

Richard S. Zemel and Geoffrey E. Hinton.
Developing population codes by minimizing description length.
In Jack D. Cowan, Gerald Tesauro, and Joshua Alspector, editors, NIPS 6, pages 11-18, San Francisco, 1994. Morgan Kaufmann.