Learning Parameters in Discrete Naive Bayes Models by Computing Fibers of the Parametrization map

author: Vincent Auvray, University of Liège
author: Louis Wehenkel, University of Liège
published: Dec. 20, 2008,   recorded: December 2008,   views: 418
Categories

Slides

Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.
  Bibliography

Description

Discrete Naive Bayes models are usually defined parametrically with a map from a parameter space to a probability distribution space. First, we present two families of algorithms that compute the set of parameters mapped to a given discrete Naive Bayes distribution satisfying certain technical assumptions. Using these results, we then present two families of parameter learning algorithms that operate by projecting the distribution of observed relative frequencies in a dataset onto the discrete Naive Bayes model considered. They have nice convergence properties, but their computational complexity grows very quickly with the number of hidden classes of the model.

See Also:

Download slides icon Download slides: aml08_auvray_lpdnbmcfpm_01.pdf (91.7 KB)


Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: