A review of: “STOCHASTIC COMPLEXITY IN STATISTICAL INQUIRY”, by Jorma Rissanen. World Scientific, Singapore, London, and Teaneck (NJ), 1989. v + 178 pages.
暂无分享,去创建一个
[1] Jorma Rissanen,et al. Universal coding, information, prediction, and estimation , 1984, IEEE Trans. Inf. Theory.
[2] Thomas Jackson,et al. Neural Computing - An Introduction , 1990 .
[3] G. Klir,et al. Fuzzy Measure Theory , 1993 .
[4] J. Rissanen. A UNIVERSAL PRIOR FOR INTEGERS AND ESTIMATION BY MINIMUM DESCRIPTION LENGTH , 1983 .
[5] Ernst von Glasersfeld,et al. The Construction of Knowledge, Contributions to Conceptual Semantics. , 1987 .
[6] E. Lorenz. Deterministic nonperiodic flow , 1963 .
[7] J. Rissanen,et al. Modeling By Shortest Data Description* , 1978, Autom..
[8] M. Feder. Maximum entropy as a special case of the minimum description length criterion , 1986, IEEE Trans. Inf. Theory.
[9] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[10] P. Walley. Statistical Reasoning with Imprecise Probabilities , 1990 .
[11] J. Rissanen. Stochastic Complexity and Modeling , 1986 .
[12] Jorma Rissanen,et al. Density estimation by stochastic complexity , 1992, IEEE Trans. Inf. Theory.
[13] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .