Resources Contact Us Home
Probabilistic boosting tree framework for learning discriminative models

Image Number 5 for United States Patent #7702596.

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.

  Recently Added Patents
Atmospheric treater with roller confined discharge chamber
Phase-change memory device having multiple diodes
Flash drive
Front face of vehicle wheel
Application authentication system and method
Electrode assembly with centrally wound separator member
Systems and methods for adaptive blind mode equalization
  Randomly Featured Patents
Pneumatic tube
Treatment of cytokine growth factor caused disorders
Humidity and dew point detector
Targeting multimeric imaging agents through multilocus binding
Method for the preparation of powder mixtures
Method of manufacturing a small vibration motor
Elliptical inflatable radar reflector
Dioxo-imidazolidine derivatives, which inhibit the enzyme SOAT-1, and pharmaceutical and cosmetic compositions containing them
Tissue paper dispenser