Tan, Yan_Shuo, Ronen, Omer, Saarinen, Theo, and Yu, Bin. The Computational Curse of Big Data for Bayesian Additive Regression Trees: A Hitting Time Analysis. Retrieved from https://par.nsf.gov/biblio/10524357.
Tan, Yan_Shuo, Ronen, Omer, Saarinen, Theo, & Yu, Bin. The Computational Curse of Big Data for Bayesian Additive Regression Trees: A Hitting Time Analysis. Retrieved from https://par.nsf.gov/biblio/10524357.
Tan, Yan_Shuo, Ronen, Omer, Saarinen, Theo, and Yu, Bin.
"The Computational Curse of Big Data for Bayesian Additive Regression Trees: A Hitting Time Analysis". Country unknown/Code not available: Arxiv. https://par.nsf.gov/biblio/10524357.
@article{osti_10524357,
place = {Country unknown/Code not available},
title = {The Computational Curse of Big Data for Bayesian Additive Regression Trees: A Hitting Time Analysis},
url = {https://par.nsf.gov/biblio/10524357},
abstractNote = {},
journal = {},
publisher = {Arxiv},
author = {Tan, Yan_Shuo and Ronen, Omer and Saarinen, Theo and Yu, Bin},
}
Warning: Leaving National Science Foundation Website
You are now leaving the National Science Foundation website to go to a non-government website.
Website:
NSF takes no responsibility for and exercises no control over the views expressed or the accuracy of
the information contained on this site. Also be aware that NSF's privacy policy does not apply to this site.