Spatial sampling design based on stochastic complexity.

DOI10.1006/jmva.1999.1834zbMath1070.62500OpenAlexW2164995005MaRDI QIDQ1808839

Yanyan Li

Publication date: 9 February 2000

Published in: Journal of Multivariate Analysis (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/49dcc2f13bcfc092441e8322e8e8343393fcaef6

zbMATH Keywords

incomplete dataminimum description lengthnetwork designstochastic complexityM algorithms

Mathematics Subject Classification ID

Inference from spatial processes (62M30) Signal detection and filtering (aspects of stochastic processes) (60G35) Statistical aspects of information-theoretic topics (62B10)

Related Items

Invariant template matching in systems with spatiotemporal coding: a matter of instability, Spatial sampling design and covariance-robust minimax prediction based on convex design ideas

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal monitoring network designs
• A universal prior for integers and estimation by minimum description length
• Stochastic complexity and model selection from incomplete data
• A subclass of lattice processes applied to a problem in planar sampling
• Estimation and smoothing from incomplete data for a class of lattice processes
• Application of em-type algorithms to spatial data
• Some notes on Rissanen's stochastic complexity
• Fisher information and stochastic complexity
• On the equivalence of kriging and maximum entropy estimators