Estimating building simulation parameters via Bayesian structure learning

Proc. of 2nd Int. Workshop on Big Data, Streams and Heterogeneous Source Mining: Algorithms, Systems, Programming Models and Applications, BigMine 2013 - Held in Conj. with SIGKDD 2013 Conf.

Volumn , Issue , 2013, Pages 31-38

  Edwards, Richard E ^a   New, Joshua R ^b   Parker, Lynne E ^a  

^a University of Tennessee   (United States)

^b OAK RIDGE NATIONAL LABORATORY   (United States)

Author keywords

Big Data; Probabilistic Inference; Structure Learning

Indexed keywords

ARCHITECTURAL DESIGN; ARTIFICIAL INTELLIGENCE; ENGINES;

BAYESIAN STRUCTURE LEARNING; BUILDING DESIGN; BUILDING PARAMETERS; BUILDING SIMULATION; DESIGN POLICY; PROBABILISTIC INFERENCE; SIMULATION DATA; SIMULATION ENGINE; SIMULATION PARAMETERS; STRUCTURE-LEARNING;

BIG DATA;

EID: 84890583221     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2501221.2501226     Document Type: Conference Paper

References (27)

1. J. Bernardo, M. Bayarri, J. Berger, A. Dawid, D. Heckerman, A. Smith, M. West, et al. Hierarchical bayesian models for applications in information retrieval. In Bayesian Statistics 7: Proceedings of the Seventh Valencia International Meeting, page 25, 2003.
2. D. Blei, A. Ng, and M. Jordan. Latent dirichlet allocation. The Journal of Machine Learning Research, 3:993{1022, 2003.
3. S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein. Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends R in Machine Learning, 3(1):1{122, 2011.
4. D. Chickering. Learning equivalence classes of bayesian-network structures. The Journal of Machine Learning Research, 2:445{498, 2002.
5. A. Dobra, C. Hans, B. Jones, J. Nevins, G. Yao, and M. West. Sparse graphical models for exploring gene expression data. Journal of Multivariate Analysis, 90(1):196{212, 2004.
6. V. Franc and S. Sonnenburg. Optimized cutting plane algorithm for large-scale risk minimization. The Journal of Machine Learning Research, 10:2157{2192, 2009.
7. J. Friedman, T. Hastie, and R. Tibshirani. Sparse inverse covariance estimation with the graphical lasso. Biostatistics, 9(3):432{441, 2008.
8. N. Friedman. Learning bayesian network structure from massive datasets: The Òsparse candidateÓ algorithm background: Learning structure. Science, pages 206{215, 1999.
9. M. Gustafsson, M. Hornquist, and A. Lombardi. Large-scale reverse engineering by the lasso. Arxiv preprint q-bio/0403012, 2004.
10. I. Guyon, J. Weston, S. Barnhill, and V. Vapnik. Gene selection for cancer classification using support vector machines. Machine learning, 46(1):389{422, 2002.
11. T. Hong, F. Buhl, P. Haves, S. Selkowitz, and M. Wetter. Comparing computer run time of building simulation programs. Lawrence Berkeley National Laboratory, 2008.
12. T. Joachims. Making large-Scale SVM Learning Practical. Advances in Kernel Methods Support Vector Learning, pages 169{184, 1999.
13. M. Jordan, Z. Ghahramani, T. Jaakkola, and L. Saul. An introduction to variational methods for graphical models. Machine learning, 37(2):183{233, 1999.
14. D. Koller and N. Friedman. Probabilistic graphical models: principles and techniques. The MIT Press, 2009.
15. P. Larrañaga, M. Poza, Y. Yurramendi, R. Murga, and C. Kuijpers. Structure learning of bayesian networks by genetic algorithms: A performance analysis of control parameters. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 18(9):912{926, 1996.
16. F. Li. Structure learning with large sparse undirected graphs and its applications. PhD thesis, Carnegie Mellon University, 2007.
17. F. Li, Y. Yang, and E. Xing. From lasso regression to feature vector machine. Advances in Neural Information Processing Systems, 18:779, 2006.
18. D. Margaritis and S. Thrun. Bayesian network induction via local neighborhoods. Trans. on Pattern Analysis and Machine Intelligence, 1999.
19. A. Miller. Subset selection in regression, volume 95. CRC Press, 2002.
20. Y. Nesterov, A. Nemirovskii, and Y. Ye. Interior-point polynomial algorithms in convex programming, volume 13. SIAM, 1994.
21. J. Pellet and A. Elisseeff. Using markov blankets for causal structure learning. The Journal of Machine Learning Research, 9:1295{1342, 2008.
22. G. Schwarz. Estimating the dimension of a model. The annals of statistics, 6(2):461{464, 1978.
23. P. Spirtes, C. Glymour, and R. Scheines. Causality from probability. Carnegie-Mellon University, Laboratory for Computational Linguistics, 1989.
24. C. H. Teo, Q. Le, A. Smola, and S. V. N. Vishwanathan. A scalable modular convex solver for regularized risk minimization. In In KDD. ACM, 2007.
25. I. Tsamardinos, C. Aliferis, and A. Statnikov. Time and sample efficient discovery of markov blankets and direct causal relations. In Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 673{678. ACM, 2003.
26. I. Tsamardinos, L. Brown, and C. Aliferis. The max-min hill-climbing bayesian network structure learning algorithm. Machine learning, 65(1):31{78, 2006.
27. A. Willsky, D. Malioutov, et al. Approximate inference in Gaussian graphical models. PhD thesis, Massachusetts Institute of Technology, 2008.