Transcription of Part IV Generative Learning algorithms
{{id}} {{{paragraph}}}
CS229 Lecture notesAndrew NgPart IVGenerative Learning algorithmsSo far, we ve mainly been talking about Learning algorithms that modelp(y|x; ), the conditional distribution ofygivenx. For instance, logisticregression modeledp(y|x; ) ash (x) =g( Tx) wheregis the sigmoid func-tion. In these notes, we ll talk about a different type of Learning a classification problem in which we want to learn to distinguishbetween elephants (y= 1) and dogs (y= 0), based on some features ofan animal. Given a training set, an algorithm like logistic regression orthe perceptron algorithm (basically) tries to find a straight line that is, adecision boundary that separates the elephants and dogs. Then, to classifya new animal as either an elephant or a dog, it checks on which side of thedecision boundary it falls, and makes its prediction s a different approach. First, looking at elephants, we can buildamodel of what elephants look like.
CS229Lecturenotes Andrew Ng Part IV Generative Learning algorithms So far, we’ve mainly been talking about learning algorithms that model p(y|x;θ), the conditional distribution of y given x.
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}
The Kolb Learning Style Inventory—Version, Learning, Course 1: Teaching & Facilitating Learning - Level I, TEACHING & FACILITATING LEARNING-LEVEL I 1, 1 Course 1: Teaching & Facilitating Learning - Level I, Machine learning, Learning the Difference Between 1, 1 Learning the Difference Between 1, I’m Learning to Spell, I'm Learning to Spell, Introduction to Machine Learning