CT-NOR: Representing and Reasoning About Events in Continuous Time

Abstract

We present a generative model for representing and reasoning about the relationships among events in continuous time. We apply the model to the domain of networked and distributed computing environments where we fit the parameters of the model from timestamp observations, and then use hypothesis testing to discover dependencies between the events and changes in behavior for monitoring and diagnosis. After introducing the model, we present an EM algorithm for fitting the parameters and then present the hypothesis testing approach for both dependence discovery and change-point detection. We validate the approach for both tasks using real data from a trace of network events at Microsoft Research Cambridge. Finally, we formalize the relationship between the proposed model and the noisy-or gate for cases when time can be discretized.

Cite

Text

Simma et al. "CT-NOR: Representing and Reasoning About Events in Continuous Time." Conference on Uncertainty in Artificial Intelligence, 2008.

Markdown

[Simma et al. "CT-NOR: Representing and Reasoning About Events in Continuous Time." Conference on Uncertainty in Artificial Intelligence, 2008.](https://mlanthology.org/uai/2008/simma2008uai-ct/)

BibTeX

@inproceedings{simma2008uai-ct,
  title     = {{CT-NOR: Representing and Reasoning About Events in Continuous Time}},
  author    = {Simma, Aleksandr and Goldszmidt, Moisés and MacCormick, John and Barham, Paul and Black, Richard and Isaacs, Rebecca and Mortier, Richard},
  booktitle = {Conference on Uncertainty in Artificial Intelligence},
  year      = {2008},
  pages     = {484-493},
  url       = {https://mlanthology.org/uai/2008/simma2008uai-ct/}
}