Making Tree Ensembles Interpretable
暂无分享,去创建一个
[1] H. Chipman,et al. Bayesian Treed Generalized Linear Models , 2003 .
[2] Satoshi Morinaga,et al. Fully-Automatic Bayesian Piecewise Sparse Linear Models , 2014, AISTATS.
[3] Robert A. Jacobs,et al. Hierarchical Mixtures of Experts and the EM Algorithm , 1993, Neural Computation.
[4] J. Friedman. Greedy function approximation: A gradient boosting machine. , 2001 .
[5] Simon Kasif,et al. A System for Induction of Oblique Decision Trees , 1994, J. Artif. Intell. Res..
[6] Yixin Chen,et al. Optimal Action Extraction for Random Forests and Boosted Trees , 2015, KDD.
[7] Tianqi Chen,et al. XGBoost: A Scalable Tree Boosting System , 2016, KDD.
[8] Leo Breiman,et al. Classification and Regression Trees , 1984 .
[9] Kilian Q. Weinberger,et al. Web-Search Ranking with Initialized Gradient Boosted Regression Trees , 2010, Yahoo! Learning to Rank Challenge.
[10] Matthew J. Beal. Variational algorithms for approximate Bayesian inference , 2003 .
[11] Jialei Wang,et al. Trading Interpretability for Accuracy: Oblique Treed Sparse Additive Models , 2015, KDD.
[12] Leo Breiman,et al. Random Forests , 2001, Machine Learning.
[13] Houtao Deng,et al. Interpreting tree ensembles with inTrees , 2018, International Journal of Data Science and Analytics.
[14] Athanasios Tsanas,et al. Accurate quantitative estimation of energy performance of residential buildings using statistical machine learning tools , 2012 .