会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明授权
    • Probabilistic boosting tree framework for learning discriminative models
    • 用于学习歧视模型的概率增强树框架
    • US07702596B2
    • 2010-04-20
    • US12180696
    • 2008-07-28
    • Zhuowen TuAdrian Barbu
    • Zhuowen TuAdrian Barbu
    • G06F15/18
    • G06N7/005G06K9/6256G06K2209/05G06N99/005G06T7/74G06T7/77G06T2207/10072G06T2207/10132G06T2207/20132G06T2207/30044G06T2207/30048G06T2207/30201
    • A probabilistic boosting tree framework for computing two-class and multi-class discriminative models is disclosed. In the learning stage, the probabilistic boosting tree (PBT) automatically constructs a tree in which each node combines a number of weak classifiers (e.g., evidence, knowledge) into a strong classifier or conditional posterior probability. The PBT approaches the target posterior distribution by data augmentation (e.g., tree expansion) through a divide-and-conquer strategy. In the testing stage, the conditional probability is computed at each tree node based on the learned classifier which guides the probability propagation in its sub-trees. The top node of the tree therefore outputs the overall posterior probability by integrating the probabilities gathered from its sub-trees. In the training stage, a tree is recursively constructed in which each tree node is a strong classifier. The input training set is divided into two new sets, left and right ones, according to the learned classifier. Each set is then used to train the left and right sub-trees recursively.
    • 公开了一种用于计算两类和多类判别模型的概率提升树框架。 在学习阶段,概率增强树(PBT)自动构建一棵树,其中每个节点将多个弱分类器(例如,证据,知识)组合成强分类器或条件后验概率。 PBT通过划分和征服策略通过数据增加(例如,树扩展)来接近目标后验分布。 在测试阶段,基于学习的分类器在每个树节点计算条件概率,该分类器引导其子树中的概率传播。 因此,树的顶级节点通过整合从其子树收集的概率输出总后验概率。 在训练阶段,递归地构造树,其中每个树节点是强分类器。 根据学习分类器,输入训练集分为左右两组。 然后每组用于递归地训练左右子树。