首页> 外文学位 >Bayesian classification using Bayesian additive and regression trees.
【24h】

Bayesian classification using Bayesian additive and regression trees.

机译:使用贝叶斯加性树和回归树进行贝叶斯分类。

获取原文
获取原文并翻译 | 示例

摘要

In this dissertation, we developed a Bayesian approach to classification problems. Classification problems range from recognizing handwritten text to predicting whether an individual will develop a certain disease. To address classification problems, various methods (for example, Classification Trees, Artificial Neural Networks, Support Vector machines) have been developed. However, still there are problems where classification error rate is 10% or higher; in addition, applications of classifiers have shown that estimating class membership probabilities, and their uncertainty, is very important aspect of classification problems. In this dissertation, we addressed the above issues by developing a new classifier: CBART. The classifier is based on Bayesian Additive and Regression trees (BART); we used latent variables to extend BART to binary and multiclass ordered classification problems. Our investigation has shown that CBART provides error rates and AUC (Area Under the Curve) comparable with those of benchmark classifiers. The benefits of CBART are that it provides class membership probabilities and their distributions; hence, using CBART, we have a measure of the uncertainty related to class membership probability. Other methods such as Logistic Regression (LR) provide class membership probabilities and their distribution. LR, however, assumes a linear model. Instead, CBART, being based on classification trees, is able to deal with non-continuous classification problems. Furthermore by using a Tree-based approach, CBART automatically selects among the available predictors. Other classifiers (e.g. Logistic Regression and Neural Networks) use all available predictors. Finally, in this research we provided methods that can be used to measure classifiers' importance, and we have provided ideas for future research.
机译:本文提出了一种贝叶斯分类方法。分类问题的范围从识别手写文本到预测个人是否会患某种疾病。为了解决分类问题,已经开发了各种方法(例如,分类树,人工神经网络,支持向量机)。但是,仍然存在分类错误率为10%或更高的问题。另外,分类器的应用表明,估计类成员的概率及其不确定性是分类问题的重要方面。在本文中,我们通过开发一个新的分类器CBART解决了上述问题。分类器基于贝叶斯可加和回归树(BART);我们使用潜在变量将BART扩展到二进制和多类有序分类问题。我们的研究表明,CBART提供的错误率和AUC(曲线下面积)可与基准分类器相媲美。 CBART的好处在于它提供了类成员资格概率及其分布;因此,使用CBART,我们可以测量与类成员资格概率有关的不确定性。其他方法(例如逻辑回归(LR))提供类成员资格概率及其分布。但是,LR假定为线性模型。相反,基于分类树的CBART能够处理非连续分类问题。此外,通过使用基于树的方法,CBART自动在可用的预测变量中进行选择。其他分类器(例如逻辑回归和神经网络)使用所有可用的预测变量。最后,在这项研究中,我们提供了可用于衡量分类器重要性的方法,并为以后的研究提供了思路。

著录项

  • 作者

    Nappa, Dario.;

  • 作者单位

    Southern Methodist University.;

  • 授予单位 Southern Methodist University.;
  • 学科 Statistics.
  • 学位 Ph.D.
  • 年度 2008
  • 页码 209 p.
  • 总页数 209
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 统计学;
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号