This paper considers the approximation problem for an observable random flow of events using an MC-flow. A separation algorithm for stationarity segments is suggested. In addition, we propose an evaluation algorithm for the number of states and intensity of the approximating MC-flow by event occurrence instants in the observable flow.
No takes yet. Share an insight, caveat, or question.
Bekkerman et al. (2013) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: