2019
DOI: 10.1016/j.ejor.2019.04.018
|View full text |Cite
|
Sign up to set email alerts
|

Fitting procedure for the two-state Batch Markov modulated Poisson process

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
7
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
4
1

Relationship

2
3

Authors

Journals

citations
Cited by 5 publications
(7 citation statements)
references
References 48 publications
0
7
0
Order By: Relevance
“…Also, it is of interest to obtain probabilities of the counting process N T (t) (N K (k)), number of failures up to t(k), as in Neuts and Li (1997). A third theoretical problem is the extension of the process proposed in this paper to its batch counterpart, where failures can occur in simultaneous way (see Yera et al (2018Yera et al ( , 2019 for results concerning the batch counterpart of the MMPP 2 ). Also, characterizing the bivariate MMPP 2 by a set of moments is a challenging goal from the inference point of view.…”
Section: Discussionmentioning
confidence: 99%
“…Also, it is of interest to obtain probabilities of the counting process N T (t) (N K (k)), number of failures up to t(k), as in Neuts and Li (1997). A third theoretical problem is the extension of the process proposed in this paper to its batch counterpart, where failures can occur in simultaneous way (see Yera et al (2018Yera et al ( , 2019 for results concerning the batch counterpart of the MMPP 2 ). Also, characterizing the bivariate MMPP 2 by a set of moments is a challenging goal from the inference point of view.…”
Section: Discussionmentioning
confidence: 99%
“…A number of papers has considered estimation for different classes of BMAP s, the method of moments and the EM algorithm being the most studied approaches, see [5,8,11,54,66,78] . Given a real trace of inter-loss times from the OpRisk context, we explore in this paper the estimation of the MAP 2 via a direct maximization of the likelihood function in the same spirit as in [10] .…”
Section: Statistical Estimation Of the Mapmentioning
confidence: 99%
“…Taking into account that convergence is achieved after 50 0 0 0 iterations, the Bayesian method turns out significantly slower. Recently, [78] compared the EM algorithm with a moments matching method in the context of Batch Markovian arrival processes, resulting the last one considerably faster. The estimation of the MAP 2 is not the main goal of this paper, and therefore we refer the reader to [10] , where the technical details regarding the previous approach as well as several numerical illustrations are discussed more in depth.…”
Section: Statistical Estimation Of the Mapmentioning
confidence: 99%
See 2 more Smart Citations