1,073
Views
21
CrossRef citations to date
0
Altmetric
Structured, Heteroscedastic, and Multinomial Data

Heteroscedastic BART via Multiplicative Regression Trees

, , &
Pages 405-417 | Received 20 Mar 2018, Accepted 22 Sep 2019, Published online: 22 Nov 2019

References

  • Albert, J. H., and Chib, S. (1993), “Bayesian Analysis of Binary and Polychotomous Response Data,” Journal of the American Statistical Association, 88, 669–679. DOI: 10.1080/01621459.1993.10476321.
  • Allen, G., Grosenick, L., and Taylor, J. (2013), “A Generalized Least-Square Matrix Decomposition,” Journal of the American Statistical Association, 109, 145–159. DOI: 10.1080/01621459.2013.852978.
  • Bertin-Mahieux, T. (2019), “Million Song Dataset,” available at http://labrosa.ee.columbia.edu/millionsong.
  • Bertin-Mahieux, T., Ellis, D. P. W., Whitman, B., and Lamere, P. (2011), “The Million Song Dataset,” in 12th International Conference on Music Information Retrieval (ISMIR), vol. 2, p. 10.
  • Bleich, J., and Kapelner, A. (2014), “Bayesian Additive Regression Trees With Parametric Models of Heteroskedasticity,” arXiv no. 1402.5397v1, pp. 1–20.
  • Box, G. E., and Cox, D. R. (1964), “An Analysis of Transformations,” Journal of the Royal Statistical Society, Series B, 26, 211–243. DOI: 10.1111/j.2517-6161.1964.tb00553.x.
  • Breiman, L. (2001), “Random Forests,” Machine Learning, 45, 5–32. DOI: 10.1023/A:1010933404324.
  • Carroll, R. J. (1988), Transformation and Weighting in Regression, New York: Chapman and Hall.
  • Chipman, H., George, E., and McCulloch, R. (1998), “Bayesian CART Model Search,” Journal of the American Statistical Association, 93, 935–960. DOI: 10.1080/01621459.1998.10473750.
  • Chipman, H., George, E., and McCulloch, R. (2002), “Bayesian Treed Models,” Machine Learning, 48, 299–320. DOI: 10.1023/A:1013916107446.
  • Chipman, H., George, E., and McCulloch, R. (2010), “BART: Bayesian Additive Regression Trees,” The Annals of Applied Statistics, 4, 266–298. DOI: 10.1214/09-AOAS285.
  • Cook, R. D. (2007), “Fisher Lecture: Dimension Reduction in Regresssion,” Statistical Science, 22, 1–26. DOI: 10.1214/088342306000000682.
  • Daye, Z. J., Chen, J., and Li, H. (2012), “High-Dimensional Heteroscedastic Regression With an Application to eQTL Data Analysis,” Biometrics, 68, 316–326. DOI: 10.1111/j.1541-0420.2011.01652.x.
  • Denison, D., Mallick, B., and Smith, A. (1998), “A Bayesian CART Algorithm,” Biometrika, 85, 363–377.
  • Freidman, J. H. (2001), “Greedy Function Approximation: A Gradient Boosting Machine,” Annals of Statistics, 28, 1189–1232.
  • Freund, Y., and Schapire, R. E. (1997), “A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting,” Journal of Computer and System Sciences, 55, 119–139. DOI: 10.1006/jcss.1997.1504.
  • Gneiting, T., and Raftery, A. E. (2007), “Strictly Proper Scoring Rules, Prediction, and Estimation,” Journal of the American Statistical Association, 102, 359–378. DOI: 10.1198/016214506000001437.
  • Goldberg, P. W., Williams, C. K. I., and Bishop, C. M. (1998), “Regression With Input-Dependent Noise: A Gaussian Process Treatment,” in Advances in Neural Information Processing Systems, pp. 493–499.
  • Gramacy, R., and Lee, H. (2008), “Bayesian Treed Gaussian Process Models With an Application to Computer Modeling,” Journal of the American Statistical Association, 103, 1119–1130. DOI: 10.1198/016214508000000689.
  • Koenker, R. (2005), Quantile Regression, Cambridge: Cambridge University Press.
  • Koenker, R., and Bassett, G. W. (1978), “Regression Quantiles,” Econometrica, 49, 33–50. DOI: 10.2307/1913643.
  • Langford, J., Li, L., and Strehl, A. L. (2007), “Vowpal Wabbit (Fast Online Learning).”
  • McCulloch, R., Pratola, M. T., and Chipman, H. (2019), “rbart: Bayesian Trees for Conditional Mean and Variance,” available at https://CRAN.R-project.org/package=rbart. DOI: 10.1080/10618600.2019.1677243.
  • Murray, J. S. (2017), “Log-Linear Bayesian Additive Regression Trees for Categorical and Count Responses,” arXiv no. 1701.01503.
  • Pratola, M. T. (2016), “Efficient Metropolis-Hastings Proposal Mechanisms for Bayesian Regression Tree Models,” Bayesian Analysis, 11, 885–911. DOI: 10.1214/16-BA999.
  • R Core Team (2019), R: A Language and Environment for Statistical Computing, Vienna, Austria: R Foundation for Statistical Computing.
  • Rizzo, M., and Szekely, G. (2018), “energy: E-Statistics: Multivariate Inference via the Energy of Data,” available at https://CRAN.R-project.org/package=energy.
  • Rockova, V., and van der Pas, S. (2017), “Posterior Concentration for Bayesian Regression Trees and Their Ensembles,” arXiv no. 1708.08734.
  • Sang, H., and Huang, J. (2012), “A Full Scale Approximation of Covariance Functions for Large Spatial Data Sets,” Journal of the Royal Statistical Society, Series B, 74, 111–132. DOI: 10.1111/j.1467-9868.2011.01007.x.
  • Székely, G. J., and Rizzo, M. L. (2004), “Testing for Equal Distributions in High Dimension,” InterStat, 5, 1–6.
  • Taddy, M., Gramacy, R., and Polson, N. (2011), “Dynamic Trees for Learning and Design,” Journal of the American Statistical Association, 106, 109–123. DOI: 10.1198/jasa.2011.ap09769.
  • Tibshirani, R. (1996), “Regression Shrinkage and Selection via the Lasso,” Journal of the Royal Statistical Society, Series B, 58, 267–288. DOI: 10.1111/j.2517-6161.1996.tb02080.x.
  • Yeo, I. K., and Johnson, R. A. (2000), “A New Family of Power Transformations to Improve Normality or Symmetry,” Biometrika, 87, 954–959. DOI: 10.1093/biomet/87.4.954.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.