Consistent estimation of the basic neighborhood of Markov random fields
暂无分享,去创建一个
[1] P. L. Dobruschin. The Description of a Random Field by Means of Conditional Probabilities and Conditions of Its Regularity , 1968 .
[2] Alfréd Rényi,et al. Probability Theory , 1970 .
[3] H. Akaike,et al. Information Theory and an Extension of the Maximum Likelihood Principle , 1973 .
[4] J. Besag. Statistical Analysis of Non-Lattice Data , 1975 .
[5] G. Schwarz. Estimating the Dimension of a Model , 1978 .
[6] B. G. Quinn,et al. The determination of the order of an autoregression , 1979 .
[7] D. Haughton. On the Choice of a Model to Fit Data from an Exponential Family , 1988 .
[8] Hans-Otto Georgii,et al. Gibbs Measures and Phase Transitions , 1988 .
[9] F. Comets. On Consistency of a Class of Estimators for Exponential Families of Markov Random Fields on the Lattice , 1992 .
[10] Frans M. J. Willems,et al. The context-tree weighting method: basic properties , 1995, IEEE Trans. Inf. Theory.
[11] Meir Feder,et al. A universal finite memory source , 1995, IEEE Trans. Inf. Theory.
[12] C. Ji,et al. A consistent model selection procedure for Markov random fields based on penalized pseudolikelihood , 1996 .
[13] P. Bühlmann,et al. Variable Length Markov Chains: Methodology, Computing, and Software , 2004 .
[14] Frans M. J. Willems,et al. Context-tree maximizing , 2000 .
[15] I. Csiszár,et al. The consistency of the BIC Markov order estimator , 2000 .
[16] Imre Csiszár. Large-scale typicality of Markov sample paths and consistency of MDL Order estimators , 2002, IEEE Trans. Inf. Theory.
[17] Imre Csiszár,et al. Context tree estimation for not necessarily finite memory processes, via BIC and MDL , 2005, IEEE Transactions on Information Theory.