Algorithm for the exact likelihood of a counting process

DOI10.1080/00207728708967158MaRDI QIDQ3776451zbMATH OpenOpenAlexFDO

Authors A. Thavaneswaran, T. E. Unny

Publication date 1987

Published in International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207728708967158

zbMATH Keywords

Adaptive estimationcounting process modelDiscrete-time modelsexact maximum likelihood estimatesunequally-spaced datanonlinear intensityPoisson-gamma filter

Mathematics Subject Classification ID

Markov processes: estimation; hidden Markov models (62M05) Inference from stochastic processes and prediction (62M20) Estimation and detection in stochastic control theory (93E10)

Recommendations

• Recursive approximate maximum likelihood estimation for a class of counting process models
• An on-line parameter estimation algorithm for counting process observations (Corresp.)
• LMMSE estimation based on counting observations
• Recursive parameter estimation for counting processes with linear intensity
• Suboptimal nonlinear filtering of the rate of an observed point process

Cites work

• MODEL REFERENCE ADAPTIVE SYSTEM ESTIMATES FOR COUNTING PROCESSES
• Maximum Likelihood Fitting of ARMA Models to Time Series with Missing Observations
• Nonparametric inference for a family of counting processes
• Optimal estimation for semimartingales
• Point processes and queues. Martingale dynamics

Cited in

(3)

• Exact Filtering for Partially Observed Continuous Time Models
• A comparison of three algorithms in the filtering of a Markov-modulated non-homogeneous Poisson process
• Approximate filtering of conditional intensity process for Poisson count data: application to urban crime

This page was built for publication: Algorithm for the exact likelihood of a counting process

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3776451)