Computationally efficient approximate likelihood procedures for the Boolean model
type: Item
instance of: scholarly article
title: Computationally efficient approximate likelihood procedures for the Boolean model
zbMATH Open document ID: 1429.60021
DOI: 10.1016/S0167-9473(02)00325-0
author: John C. Handley
published in: Computational Statistics and Data Analysis
publication date: 2008-11-26T00:00:00Z
Mathematics Subject Classification ID: 60D05
zbMATH DE Number: 5373943
zbMATH Keywords: maximum likelihood
zbMATH Keywords: recursion
zbMATH Keywords: germ-grain model
zbMATH Keywords: likelihood ratio test
zbMATH Keywords: confidence region
zbMATH Keywords: parameter estimation
zbMATH Keywords: random set
MaRDI profile type: Publication
cites work: Sparse Sampling and Maximum Likelihood Estimation for Boolean Models
cites work: Random Set Theory and Problems of Modeling
cites work: Q4226071
cites work: Recursive maximum-likelihood estimation in the one-dimensional discrete Boolean random set model
cites work: Parameter Estimation in the Poisson Field of Discs
cites work: Q4040734
cites work: Exact sampling from conditional Boolean models with applications to maximum likelihood inference
cites work: Q3994364
cites work: Algebraic analysis of the generating functional for discrete random sets and statistical inference for intensity in the discrete Boolean random-set model
cites work: The busy period of the queueing system M/G/∞
cites work: Q4842952
full work available at URL: s0167-9473(02)00325-0
OpenAlex ID: W2086190013
description: scientific article; zbMATH DE number 5373943