Minimum Message Length and Kolmogorov Complexity (1999)

Cached

Download Links

by C. S. Wallace , D. L. Dowe
Venue:Computer Journal
Citations:104 - 25 self

Documents Related by Co-Citation

311 An Information Measure for Classification – C Wallace, D Boulton - 1968
1683 An introduction to Kolmogorov Complexity and its Applications: Preface to the First Edition – Ming Li, Paul Vitanyi - 1997
8567 Elements of Information Theory – T M Cover, J A Thomas - 1991
498 Stochastic Complexity – J Rissanen - 1989
2307 Estimating the dimension of a model – G SCHWARZ - 1978
86 2005): Statistical and Inductive Inference by Minimum Message – C S Wallace
1840 A new look at the statistical model identification – Hirotugu Akaike - 1974
187 Estimation and inference by compact coding – C S Wallace, P R Freeman - 1987
249 Stochastic complexity and modeling – Jorma Rissanen - 1986
942 The EM Algorithm and Extensions – Geoffrey J Mclachlan, Thriyambakam Krishnan - 1996
5 A Note on the Comparison of Polynomial Selection Methods – M Viswanathan, C S Wallace - 1999
8980 The Nature of Statistical Learning Theory – Vladimir N. Vapnik - 1995
1160 Modeling by shortest data description – Jorma Rissanen - 1983
56 Least mean square error reconstruction principle for self-organizing neural-nets – L Xu - 1993
2112 A New Approach to Linear Filtering and Prediction Problems – R E Kalman - 1960
85 Statistical inference in factor analysis – T W Anderson, H Rubin - 1956
176 Model selection and Akaike’s Information Criterion (AIC): The general theory and its analytical extensions РH Bozdogan - 1987
90 Rival penalized competitive learning for clustering analysis, RBF net, and curve detection – L Xu, A Krzyzak, E Oja - 1993
398 A universal prior for integers and estimation by minimum description length – J Rissanen - 1983