首页> 外文学位 >Bayes nets: A generalized variable elimination algorithm and applications to classification.
【24h】

Bayes nets: A generalized variable elimination algorithm and applications to classification.

机译:贝叶斯网络:广义变量消除算法及其在分类中的应用。

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

摘要

The first part (Chapter 2 and 3) of the dissertation introduces an exact inference algorithm for discrete Bayesian Networks, which is an extension of the generalized variable elimination (GVE) algorithm. We globalize the query-oriented algorithm GVE by specifying a minimal query set and allowing observed variables as "bucket" variables. In any network, the set of all leaf nodes is the minimal query set. The proposed algorithm builds a bucket tree of data structure buckets and then updates the bucket tree to produce the marginal probability density for every variable in the network. This algorithm relies solely on independence relations and probability manipulation, without requiring any complex graph theory, thus making it easy to understand and implement.; The second part (Chapter 4) of this dissertation investigates the performance of Bayesian networks in classification and compares its performance with Support Vector Machine (SVM) methods and the Classification tree method, QUEST. When the relationship between variables is known, the Bayesian network method usually works better than SVM methods, especially in high dimensional problems. The advantage of the Bayesian network method also lies in its ability in handling missing values inside both the training and the test set. When the training set is not very large, discarding records with missing values will affect the performance of classification. Bayesian network methods utilize records with missing values and can provide classification comparable to non-missing training set with the same size. Also Bayesian networks can classify records with missing values, whereas SVM does not have this nice property. The Bayesian network method is better than QUEST when missing values present in test set.; The computational parts of this dissertation use Kevin Murphy's Bayes Net Toolbox for Matlab, SVM and Kernel Methods Matlab Toolbox from Insa de Rouen, QUEST Classification Tree (version 1.9.2) by Wei-Yin Loh and Yu-Shan Shih.
机译:论文的第一部分(第二章和第三章)介绍了一种精确的离散贝叶斯网络推理算法,它是广义变量消除算法的扩展。我们通过指定最小查询集并将观察到的变量作为“存储桶”变量来全球化面向查询的算法GVE。在任何网络中,所有叶节点的集合都是最小查询集。所提出的算法建立了一个数据结构桶的桶树,然后更新该桶树以产生网络中每个变量的边际概率密度。该算法仅依赖于独立性关系和概率操纵,不需要任何复杂的图论,因此易于理解和实现。本文的第二部分(第4章)研究了贝叶斯网络在分类中的性能,并将其与支持向量机(SVM)方法和分类树方法QUEST进行了比较。当变量之间的关系已知时,贝叶斯网络方法通常比SVM方法更好,特别是在高维问题中。贝叶斯网络方法的优势还在于它能够处理训练和测试集中的缺失值。当训练集不是很大时,丢弃缺少值的记录将影响分类的性能。贝叶斯网络方法利用具有缺失值的记录,并且可以提供与具有相同大小的无缺失训练集相当的分类。贝叶斯网络也可以对缺失值的记录进行分类,而SVM则没有这种好的属性。当测试集中存在缺失值时,贝叶斯网络方法比QUEST更好。本文的计算部分使用的是凯文·墨菲(Kevin Murphy)的用于Matlab的Bayes Net工具箱,支持向量机(SVM)和内核方法(来自Insa de Rouen的Matlab工具箱),奎斯特分类树(1.9.2版),作者是罗卫银和施玉山。

著录项

  • 作者

    Lei, Xiaofang.;

  • 作者单位

    University of California, Santa Barbara.;

  • 授予单位 University of California, Santa Barbara.;
  • 学科 Statistics.; Artificial Intelligence.
  • 学位 Ph.D.
  • 年度 2006
  • 页码 95 p.
  • 总页数 95
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 统计学;人工智能理论;
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号