Learning large-scale Poisson DAG models based on overdispersion scoring

Advances in Neural Information Processing Systems

Volumn 2015-January, Issue , 2015, Pages 631-639

  Park, Gunwoong ^a   Raskutti, Garvesh ^a  

^a University of Wisconsin Madison   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; INFORMATION SCIENCE; POLYNOMIAL APPROXIMATION;

GRAPHICAL MODEL; IDENTIFIABILITY; OBSERVATIONAL DATA; POISSON RANDOM VARIABLES; POLYNOMIAL-TIME ALGORITHMS; RATE PARAMETERS; REGULARITY CONDITION; THEORETICAL GUARANTEES;

LEARNING ALGORITHMS;

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

References (19)

1. E. Yang, G. Allen, Z. Liu, and P. K. Ravikumar, "Graphical models via generalized linear models", in Advances in Neural Information Processing Systems, 2012, pp. 1358-1366.
2. P. Bonissone, M. Henrion, L. Kanal, and J. Lemmer, "Equivalence and synthesis of causal models", in Uncertainty in artificial intelligence, vol. 6, 1991, p. 255.
3. P. Spirtes, C. Glymour, and R. Scheines, Causation, Prediction and Search. MIT Press, 2000.
4. S. L. Lauritzen, Graphical models. Oxford University Press, 1996.
5. D. M. Chickering, "Learning Bayesian networks is NP-complete", in Learning from data. Springer, 1996, pp. 121-130.
6. C. Uhler, G. Raskutti, P. Bühlmann, B. Yu et al., "Geometry of the faithfulness assumption in causal inference", The Annals of Statistics, vol. 41, no. 2, pp. 436-463, 2013.
7. C. B. Dean, "Testing for overdispersion in Poisson and binomial regression models", Journal of the American Statistical Association, vol. 87, no. 418, pp. 451-457, 1992.
8. T. Zheng, M. J. Salganik, and A. Gelman, "How many people do you know in prison? Using overdispersion in count data to estimate social structure in networks", Journal of the American Statistical Association, vol. 101, no. 474, pp. 409-423, 2006.
9. J. Peters and P. Bühlmann, "Identifiability of Gaussian structural equation models with equal error variances", Biometrika, p. ast043, 2013.
10. S. Shimizu, P. O. Hoyer, A. Hyvärinen, and A. Kerminen, "A linear non-Gaussian acyclic model for causal discovery", The Journal of Machine Learning Research, vol. 7, pp. 2003-2030, 2006.
11. J. Peters, J. Mooij, D. Janzing et al., "Identifiability of causal graphs using functional models", arXiv preprint arXiv:1202.3757, 2012.
12. I. Tsamardinos, L. E. Brown, and C. F. Aliferis, "The max-min hill-climbing Bayesian network structure learning algorithm", Machine learning, vol. 65, no. 1, pp. 31-78, 2006.
13. C. F. Aliferis, I. Tsamardinos, and A. Statnikov, "HITON: a novel Markov Blanket algorithm for optimal variable selection", in AMIA Annual Symposium Proceedings, vol. 2003. American Medical Informatics Association, 2003, p. 21.
14. R. G. Cowell, P. A. Dawid, S. L. Lauritzen, and D. J. Spiegelhalter, Probabilistic Networks and Expert Systems. Springer-Verlag, 1999.
15. I. Tsamardinos and C. F. Aliferis, "Towards principled feature selection: Relevancy, filters and wrappers", in Proceedings of the ninth international workshop on Artificial Intelligence and Statistics. Morgan Kaufmann Publishers: Key West, FL, USA, 2003.
16. N. Friedman, I. Nachman, and D. Peér, "Learning bayesian network structure from massive datasets: the sparse candidate algorithm", in Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence. Morgan Kaufmann Publishers Inc., 1999, pp. 206-215.
17. J. Friedman, T. Hastie, and R. Tibshirani, "glmnet: Lasso and elastic-net regularized generalized linear models", R package version, vol. 1, 2009.
18. D. M. Chickering, "Optimal structure identification with greedy search", The Journal of Machine Learning Research, vol. 3, pp. 507-554, 2003.
19. D. Heckerman, D. Geiger, and D. M. Chickering, "Learning Bayesian networks: The combination of knowledge and statistical data", Machine learning, vol. 20, no. 3, pp. 197-243, 1995.