Project Euclid

References

• [1] Black, M. J. and Rangarajan, A. (1996). On the unification of line processes, outlier rejection, and robust statistics with applications in early vision., International Journal of Computer Vision, 19(1):57–91.
• [2] Boyd, S. and Vandenberghe, L. (2004)., Convex Optimization. Cambridge University Press.
  Zentralblatt MATH: 1058.90049
  
• [3] Bühlmann, P. and Hothorn, T. (2007). Boosting algorithms: Regularization, prediction and model fitting (with discussion)., Statistical Science, 22(4):477–505.
  Zentralblatt MATH: 1246.62163
  Digital Object Identifier: doi:10.1214/07-STS242
  Project Euclid: euclid.ss/1207580163
  
• [4] Bühlmann, P. and Hothorn, T. (2010). Twin boosting: improved feature selection and prediction., Statistics and Computing, 20:119–138.
• [5] Dempster, A. P., Laird, N. M., and Rubin, D. B. (1977). Maximum likelihood from incomplete data via the EM algorithm (with discussion)., Journal of the Royal Statistical Society, Series B, 39(1):1–38.
  Zentralblatt MATH: 0364.62022
  
• [6] Freund, Y. (2001). An adaptive version of the boost by majority algorithm., Machine Learning, 43(3):293–318.
  Zentralblatt MATH: 0988.68150
  Digital Object Identifier: doi:10.1023/A:1010852229904
  
• [7] Freund, Y. (2009). A more robust boosting algorithm., arXiv preprint https://arxiv.org/abs/0905.2138.
• [8] Freund, Y. and Schapire, R. E. (1995). A decision-theoretic generalization of on-line learning and an application to boosting. In, European Conference on Computational Learning Theory, pages 23–37.
• [9] Freund, Y. and Schapire, R. E. (1996). Experiments with a new boosting algorithm. In, International Conference on Machine Learning, pages 148–156.
• [10] Friedman, B., Henke, R. M., and Wier, L. M. (2010). Most expensive hospitalizations, 2008., Agency for Health Care Policy and Research (US). http://www.hcup-us.ahrq.gov/reports/statbriefs/sb97.pdf.
• [11] Friedman, J. (2001). Greedy function approximation: a gradient boosting machine., Annals of Statistics, 29(5):1189–1232.
  Zentralblatt MATH: 1043.62034
  Digital Object Identifier: doi:10.1214/aos/1013203451
  Project Euclid: euclid.aos/1013203451
  
• [12] Friedman, J., Hastie, T., Tibshirani, R., et al. (2000). Additive logistic regression: a statistical view of boosting (with discussion and a rejoinder by the authors)., Annals of Statistics, 28(2):337–407.
  Zentralblatt MATH: 1106.62323
  Digital Object Identifier: doi:10.1214/aos/1016218223
  Project Euclid: euclid.aos/1016218223
  
• [13] Grubb, A. and Bagnell, J. A. (2011). Generalized boosting algorithms for convex optimization. In, Proceedings of the 28th International Conference on International Conference on Machine Learning, pages 1209–1216. Omnipress.
• [14] Krause, N. and Singer, Y. (2004). Leveraging the margin more carefully. In, Proceedings of the Twenty-first International Conference on Machine Learning, page 63, Banff, Canada. ACM.
• [15] Lange, K. (2013)., Optimization. Springer, New York, second edition.
• [16] Li, A. H. and Bradic, J. (2015). Boosting in the presence of outliers: adaptive classification with non-convex loss functions., http://arxiv.org/pdf/1510.01064v1.pdf.
• [17] Lin, Y. (2004). A note on margin-based loss functions in classification., Statistics & Probability Letters, 68(1):73–82.
  Mathematical Reviews (MathSciNet): MR2064687
  Zentralblatt MATH: 1058.62052
  Digital Object Identifier: doi:10.1016/j.spl.2004.03.002
  
• [18] Mason, L., Baxter, J., Bartlett, P., and Frean, M. (2000). Functional gradient techniques for combining hypotheses. In Smola, A., Bartlett, P., Schölkopf, B., and Schuurmans, D., editors, Advances in Large Margin Classifiers, pages 221–246, Cambridge, MA. MIT Press.
• [19] Mayr, A., Binder, H., Gefeller, O., and Schmid, M. (2014). The evolution of boosting algorithms: From machine learning to statistical modelling (together with the companion review and an invited discussion)., Methods of Information in Medicine, 53(6):419–427.
• [20] McDonald, R. A., Hand, D. J., and Eckley, I. A. (2004). A Multiclass Extension to the Brownboost Algorithm., International Journal of Pattern Recognition and Artificial Intelligence, 18(05):905–931.
• [21] McLachlan, G. and Krishnan, T. (2007)., The EM Algorithm and Extensions, volume 382. John Wiley & Sons.
  Zentralblatt MATH: 1165.62019
  
• [22] Moturu, S. T., Johnson, W. G., and Liu, H. (2007). Predicting future high-cost patients: a real-world risk modeling application. In, IEEE International Conference on Bioinformatics and Biomedicine, pages 202–208. IEEE.
• [23] Nesterov, Y. (2004)., Introductory Lectures on Convex Optimization: A Basic Course. Springer Science & Business Media.
  Zentralblatt MATH: 1086.90045
  
• [24] Park, S. Y. and Liu, Y. (2011). Robust penalized logistic regression with truncated loss functions., Canadian Journal of Statistics, 39(2):300–323.
  Zentralblatt MATH: 1219.62105
  Digital Object Identifier: doi:10.1002/cjs.10105
  
• [25] Schwarz, G. (1978). Estimating the dimension of a model., Annals of Statistics, 6(2):461–464.
  Zentralblatt MATH: 0379.62005
  Digital Object Identifier: doi:10.1214/aos/1176344136
  Project Euclid: euclid.aos/1176344136
  
• [26] Searle, S. R. (1982)., Matrix Algebra Useful for Statistics (Wiley Series in Probability and Statistics). Wiley-Interscience.
  Mathematical Reviews (MathSciNet): MR670947
  
• [27] Shi, L., Campbell, G., Jones, W., Campagne, F., et al. (2010). The MicroArray Quality Control (MAQC)-II study of common practices for the development and validation of microarray-based predictive models., Nature Biotechnology, 28(8):827–838. https://goo.gl/8bdBDE.
• [28] Sutherland, S. M., Ji, J., Sheikhi, F. H., Widen, E., Tian, L., Alexander, S. R., and Ling, X. B. (2013). AKI in hospitalized children: epidemiology and clinical associations in a national cohort., Clinical Journal of the American Society of Nephrology, 8(10):1661–1669.
• [29] Tao, P. D. and An, L. T. H. (1997). Convex analysis approach to dc programming: Theory, algorithms and applications., Acta Mathematica Vietnamica, 22(1):289–355.
  Zentralblatt MATH: 0895.90152
  
• [30] Vapnik, V. (1996)., The Nature of Statistical Learning Theory. Springer-Verlag, New York.
  Zentralblatt MATH: 0934.62009
  
• [31] Wang, Z. (2011). HingeBoost: ROC-based boost for classification and variable selection., The International Journal of Biostatistics, 7(1):1–30.
  Mathematical Reviews (MathSciNet): MR2775080
  Digital Object Identifier: doi:10.2202/1557-4679.1304
  
• [32] Wang, Z. (2012). Multi-class HingeBoost: Method and application to the classification of cancer types using gene expression data., Methods of Information in Medicine, 51(2):162–167.
• [33] Wassermann, L. (2006)., All of Nonparametric Statistics. Springer Science & Business Media, New York.
• [34] Wu, Y. and Liu, Y. (2007a). On multicategory truncated-hinge-loss support vector. In, Prediction and Discovery: AMS-IMS-SIAM Joint Summer Research Conference, Machine and Statistical Learning: Prediction and Discovery, June 25–29, 2006, Snowbird, Utah, volume 443, page 49. American Mathematical Soc.
• [35] Wu, Y. and Liu, Y. (2007b). Robust truncated hinge loss support vector machines., Journal of the American Statistical Association, 102(479):974–983.
  Zentralblatt MATH: 05564425
  Digital Object Identifier: doi:10.1198/016214507000000617
  
• [36] Yang, M., Xu, L., White, M., Schuurmans, D., and Yu, Y.-l. (2010). Relaxed clipping: A global training method for robust regression and classification. In, Advances in Neural Information Processing Systems, pages 2532–2540.
• [37] Zhang, X., Wu, Y., Wang, L., and Li, R. (2016). Variable selection for support vector machines in moderately high dimensions., Journal of the Royal Statistical Society: Series B (Statistical Methodology), 78(1):53–76.