1 / 10

Zijian Zheng, Geoffrey I. Webb, Kai Ming Ting Deakin University Victoria Australia

Lazy Bayesian Rules: A Lazy Semi-Naïve Bayesian Learning Technique Competitive to Boosting Decision Trees. Zijian Zheng, Geoffrey I. Webb, Kai Ming Ting Deakin University Victoria Australia Appeared in ICML ‘99. Paper Overview. Description of LBR, Adaboost and Bagging

leala
Télécharger la présentation

Zijian Zheng, Geoffrey I. Webb, Kai Ming Ting Deakin University Victoria Australia

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Lazy Bayesian Rules: A Lazy Semi-Naïve Bayesian Learning Technique Competitive to Boosting Decision Trees Zijian Zheng, Geoffrey I. Webb, Kai Ming Ting Deakin University Victoria Australia Appeared in ICML ‘99

  2. Paper Overview • Description of LBR, Adaboost and Bagging • Experimental Comparison of algorithms

  3. Naïve Bayesian Tree • Each tree node is a naïve bayes classifier

  4. Lazy Bayesian Rules • Build a special purpose bayesian classifier based on the example to classify • greedily choose which attributes to remain constant and which should vary

  5. Boosting / Bagging • Adaboost • train on examples • evaluate performance • re-train new classifier with weighted examples • repeat • when classifying, vote according to weights • Bagging • train many times on samples drawn with replacement • when classifying, vote equally

More Related