Change-Point Estimation Using New Minimum Message Length Approximations
暂无分享,去创建一个
[1] J. Rissanen,et al. Modeling By Shortest Data Description* , 1978, Autom..
[2] Jonathan J. Oliver,et al. Bayesian Approaches to Segmenting A Simple Time Series , 1997 .
[3] Graham Farr,et al. Algorithmic and combinatorial problems in strict minimum message length inference , 1997 .
[4] Lloyd Allison,et al. Minimum Message Length Grouping of Ordered Data , 2000, ALT.
[5] C. S. Wallace,et al. Estimation and Inference by Compact Coding , 1987 .
[6] David L. Dowe,et al. Minimum Message Length and Kolmogorov Complexity , 1999, Comput. J..
[7] Walter D. Fisher. On Grouping for Maximum Homogeneity , 1958 .
[8] David L. Dowe,et al. Point Estimation Using the Kullback-Leibler Loss Function and MML , 1998, PAKDD.
[9] Dana Ron,et al. An experimental and theoretical comparison of model selection methods , 1995, COLT '95.
[10] C. S. Wallace,et al. Minimum Message Length Segmentation , 1998, PAKDD.
[11] Kevin B. Korb,et al. Finding Cutpoints in Noisy Binary Sequences - A Revised Empirical Evaluation , 1999, Australian Joint Conference on Artificial Intelligence.
[12] Jonathan J. Oliver,et al. The Kindest Cut: Minimum Message Length Segmentation , 1996, ALT.
[13] C. S. Wallace,et al. An Information Measure for Classification , 1968, Comput. J..