Learning arithmetic circuits

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

Volumn , Issue , 2008, Pages 383-392

  Lowd, Daniel ^a   Domingos, Pedro ^a  

^a University of Washington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACCURATE PREDICTION; APPROXIMATE INFERENCE; ARITHMETIC CIRCUIT; CONDITIONAL DISTRIBUTION; GRAPHICAL MODEL; LEARNING MODELS; REAL WORLD DOMAIN; SCORE FUNCTION; TREE-WIDTH;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; BAYESIAN NETWORKS; INTEGRATING CIRCUITS;

LOGIC CIRCUITS;

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

References (20)

1. Arnborg, S., Corneil, D. W., & Proskurowski, A. (1987). Complexity of finding embeddings in a k-tree. SIAM J. Algebraic & Discrete Methods, 8, 277-284.
2. Blake, C., & Merz, C. J. (2000). UCI repository of machine learning databases. Dept. ICS, UC Irvine, CA. http://-www.ics.uci.edu/~mlearn/ MLRepository.html.
3. Boutilier, C., Friedman, N., Goldszmidt, M., & Koller, D. (1996). Context-specific independence in Bayesian networks. Proc. UAI-96 (pp. 115-123).
4. Chechetka, A., & Guestrin, C. (2008). Efficient principled learning of thin junction trees. In NIPS 20.
5. Chickering, D., Heckerman, D., & Meek, C. (1997). A Bayesian approach to learning Bayesian networks with local structure. Proc. UAI-97 (pp. 80-89).
6. Chickering, D. M. (2002). The WinMine toolkit (Tech. Rept. MSR-TR-2002-103). Microsoft, Redmond, WA.
7. Darwiche, A. (2002). A logical approach to factoring belief networks. Proc. KR-02 (pp. 409-420).
8. Darwiche, A. (2003). A differential approach to inference in Bayesian networks. J. ACM, 50, 280-305.
9. Friedman, N., & Goldszmidt, M. (1996). Learning Bayesian networks with local structure. Proc. UAI-96 (pp. 252-262).
10. Gilks, W. R., Richardson, S., & Spiegelhalter, D. J. (Eds.). (1996). Markov chain Monte Carlo in practice. Chapman and Hall.
11. Heckerman, D., Geiger, D., & Chickering, D. M. (1995). Learning Bayesian networks. Mach. Learn., 20, 197-243.
12. Hulten, G., & Domingos, P. (2002). Mining complex models from arbitrarily large databases in constant time. Proc. KDD-02 (pp. 525-531).
13. Jaeger, M., Nielsen, J., & Silander, T. (2006). Learning probabilistic decision graphs. Intl. J. Approx. Reasoning, 42, 84-100.
14. Kohavi, R., Brodley, C., Frasca, B., Mason, L., & Zheng, Z. (2000). KDD-Cup 2000 organizers' report: Peeling the onion. SIGKDD Explorations, 2, 86-98.
15. Lowd, D., & Domingos, P. (2005). Naive Bayes models for probability estimation. Proc. ICML-05 (pp. 529-536). (Pubitemid 43183375)
16. Lowd, D., & Domingos, P. (2008). Learning arithmetic circuits (Tech. Rept.). Dept. CSE, Univ. Washington, Seattle, WA. http://www.cs.washington.edu/ homes/'lowd/-lactr.pdf
17. Meila, M., & Jordan, M. (2000). Learning with mixtures of trees. J. Mach. Learn. Research, 1, 1-48. (Pubitemid 33739061)
18. Pearl, J. (1988). Probabilistic reasoning in intelligent systems. Morgan Kaufmann.
19. Roth, D. (1996). On the hardness of approximate reasoning. Artif. Intel., 82, 273-302. (Pubitemid 126374156)
20. Srebro, N. (2000). Maximum likelihood Markov networks: An algorithmic approach. Master's thesis, MIT, Cambridge, MA.