Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Algorithm for the exact likelihood of a counting process

From MaRDI portal
Publication:3776451
Jump to:navigation, search

DOI10.1080/00207728708967158zbMath0636.62098OpenAlexW2017615243MaRDI QIDQ3776451

T. E. Unny, A. Thavaneswaran

Publication date: 1987

Published in: International Journal of Systems Science (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

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




Cites Work

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




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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3776451&oldid=17322696"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 5 February 2024, at 12:42.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki