首页> 外文OA文献 >Probabilistic Decision Trees using SVM for Multi-class Classification
【2h】

Probabilistic Decision Trees using SVM for Multi-class Classification

机译:使用SVM进行多类分类的概率决策树

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

In the automotive repairing backdrop, retrieving from previously solved incident the database features that could support and speed up the diagnostic is of greatusefulness. This decision helping process should give a fixed number of the more relevant diagnostic classified in a likelihood sense. It is a probabilistic multi-class classification problem. This paper describes an original classification technique, the Probabilistic Decision Tree (PDT) producing a posteriori probabilities in a multi-class context. It is based on a Binary Decision Tree (BDT) with Probabilistic Support VectorMachine classifier (PSVM). At each node of the tree, a bi-class SVM along with a sigmoid function are trained to give a probabilistic classification output. For each branch, the outputs of all the nodes composing the branch are combined to lead to acomplete evaluation of the probability when reaching the final leaf (representing the class associated to the branch). To illustrate the effectiveness of PDTs, they are tested on benchmark datasets and results are compared with other existing approaches.
机译:在汽车维修的背景下,从以前解决的事件中检索可以支持并加快诊断速度的数据库功能非常有用。该决策帮助过程应给出固定数量的更相关的诊断(以可能性意义分类)。这是一个概率多类分类问题。本文介绍了一种原始分类技术,即概率决策树(PDT),它在多类环境中产生后验概率。它基于带有概率支持向量机分类器(PSVM)的二叉决策树(BDT)。在树的每个节点上,对双类SVM和S型函数进行训练,以给出概率分类输出。对于每个分支,组合组成该分支的所有节点的输出,以在到达最终叶子(代表与该分支关联的类)时对概率进行完整评估。为了说明PDT的有效性,在基准数据集上对它们进行了测试,并将结果与​​其他现有方法进行了比较。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号