Stochastic complexity and model selection from incomplete data

DOI10.1016/S0378-3758(98)00112-8zbMath0924.62008MaRDI QIDQ1298904

V. Pereyra

Publication date: 9 November 1999

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

zbMATH Keywords

EM algorithm; model selection; incomplete data; minimum description length; stochastic complexity

Mathematics Subject Classification ID

62M30: Inference from spatial processes

62B10: Statistical aspects of information-theoretic topics

Related Items

Spatial sampling design based on stochastic complexity.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A universal prior for integers and estimation by minimum description length
• On the convergence properties of the EM algorithm
• Stochastic complexity and modeling
• On the rate of convergence of the ECM algorithm
• Test for homogeneity of several populations by stochastic complexity
• Maximum likelihood estimation via the ECM algorithm: A general framework
• Maximum likelihood estimation with missing spatial data and with an application to remotely sensed data
• Information loss due to incomplete data from a spatial gaussian one-parameter first-order conditional process
• Analysing Data from Hormone-Receptor Assays
• A subclass of lattice processes applied to a problem in planar sampling
• Estimation and smoothing from incomplete data for a class of lattice processes
• Some notes on Rissanen's stochastic complexity
• Fisher information and stochastic complexity
• Tools for statistical inference. Methods for the exploration of posterior distributions and likelihood functions.