CT-NOR: Representing and reasoning about events in continuous time

Proceedings of the 24th Conference on Uncertainty in Artificial Intelligence, UAI 2008

Volumn , Issue , 2008, Pages 484-493

  Simma, Aleksandr ^a,c   Goldszmidt, Moises ^a   MacCormick, John ^a,b   Barham, Paul ^a   Black, Richard ^a   Isaacs, Rebecca ^a   Mortier, Richard ^a  

^a MICROSOFT RESEARCH   (United States)

^b DICKINSON COLLEGE   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CAMBRIDGE; CHANGE POINT DETECTION; CONTINUOUS TIME; DISTRIBUTED COMPUTING ENVIRONMENT; EM ALGORITHMS; GENERATIVE MODEL; HYPOTHESIS TESTING; MICROSOFT RESEARCHES; MONITORING AND DIAGNOSIS; NOISY-OR GATE; TIME-STAMP;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; BEHAVIORAL RESEARCH; CONTINUOUS TIME SYSTEMS; PARAMETER ESTIMATION;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 80053231942     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. V. Bahl, R. Chandra, A. Greenberg, S. Kandula, D. Maltz, and M. Zhang. Towards highly reliable enterprise network services via inference of multilevel dependencies. In SIGCOMM'07, Aug. 2007.
2. P. Barham, R. Black, M. Goldszmidt, R. Isaacs, J. MacCormick, R. Mortier, and A. Simma. Constellation: automated discovery of service and host dependencies in networked systems. Technical Report MSR-TR-2008-67, Microsoft Research, 2008.
3. Y. Benhamini and Y. Hochberg. Controlling the false discovery rate: a practical and powerful approach to multiple testing. Journal of the Royal Statistical Society, 57(2-3):125-133, 1995.
4. J. Breese and D. Heckerman. Causal independence for probability assessment and inference in Bayesian networks. IEEE Transactions on Systems, Man, and Cybernetics, 1996.
5. R. Durrett. Probability: Theory and Examples. Duxbury Press, second edition, 1996.
6. N. Friedman, D. Geiger, and M. Goldszmidt. Bayesian Network Classifiers. Machine Learning, 29(2-3):131-163, 1997. (Pubitemid 127510036)
7. B. Lindsay. Mixture Models: Theory, Geometry, and Applications. Institute of Mathematical Statistics, Hayward, 1995.
8. J. Listgarten and D. Heckerman. Determining the number of non-spurious arcs in a learned DAG model: Investigation of a Bayesian and a frequentist approach. In Proceedings of the International Conference on Uncertainty in Artificial Intelligence, 2007.
9. K. Murphy. Dynamic Bayesian networks: Representation, inference, and learning. Technical report, UC Berkeley, 2001. PhD Thesis.
10. U. Nodelman, C. Shelton, and D. Koller. Learning continuous time Bayesian networks. In Proceedings of the International Conference on Uncertainty in Artificial Intelligence, 2003.
11. J. Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, 1988.
12. S. Rajaram, T. Graepel, and R. Herbrich. Poissonnetworks: A model for structured point processes. In Proceedings of the International Workshop on Artificial Intelligence and Statistics, 2005.
13. J. D. Storey. A direct approach to false discovery rates. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 64(3):479-498, 2002.
14. L. Wasserman. All of Statistics. Springer, 2004.