This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CS573: Homework 3 Due date: Tuesday October 26, start of class Tree Augmented Naive Bayes In this assignment we investigate a graphical model that extends Naive Bayes (NB) for classification. NB uses a generative model which assumes conditional independence be tween the attributes ( X = { X 1 ,...,X n } ) given the class ( C ). This can be represented using a directed graphical model where the nodes are V = { X i  1 ≤ i ≤ n } ∪ { C } and the edges are E = { ( C,X i )  1 ≤ i ≤ n } . Tree Augmented Naive Bayes (TAN) augments this graphical model with a set of edges E ⊂ X × X . The restriction on E is that every X i has exactly one parent from X (in addition to C ), except for one X i that has no parents other than C . Figure 1 gives a general description of Naive Bayes versus TAN. Figure 1: Left: NB model, Right: TAN model. To estimate a TAN model, the learning algorithm needs to search over the structure of the model (i.e., which edges to add among the attributes) and then estimate the parameters of the conditional probability distributions (CPDs). Learning the structure of TAN modelof the conditional probability distributions (CPDs)....
View
Full
Document
This note was uploaded on 03/13/2012 for the course CS 573 taught by Professor Staff during the Fall '08 term at Purdue University.
 Fall '08
 Staff

Click to edit the document details