Radford M. Neal Depts. of Statistics and Computer Science, Univ. of Toronto,...  Home/Search
Context
Related
| inference.phy.cam.ac.uk/m...boost.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: inference.phy.cam.ac.uk/mack...p0 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a probabilistic interpretation of `boosting' in terms of a mixture of experts model, and give a boosting algorithm that is a crippled maximum likelihood algorithm. (Update)
Similar documents based on text: More All
0.5: Near Shannon Limit Performance of Low Density Parity Check Codes - MacKay, Neal (1996) (Correct)
0.3: Assessing Relevance Determination Methods Using DELVE - Neal (1998) (Correct)
0.3: Factor Analysis Using Delta-Rule Wake-Sleep Learning - Neal, Dayan (1996) (Correct)
BibTeX entry: (Update)
@misc{ depts-likelihoodbased,
author = "Radford Neal Depts",
title = "Likelihood--based Boosting",
url = "citeseer.ist.psu.edu/613481.html" }
Citations not processed or no citations identified.
Documents on the same site (http://www.inference.phy.cam.ac.uk/mackay/p0.html): More
(4096,3249) Gallager Codes compared with Tanner Product Codes - MacKay (1999) (Correct)
Choice of Basis for Laplace Approximation - MacKay (1998) (Correct)
BSC Thresholds for Code Ensembles Based on "Typical .. - Aji, Jin.. (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC