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.
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}}}
CORE 2 Summary Notes, Strip Building Notes for Canoes and, APPLICATION NOTE, 2 Accounting Review: Income Statements and, Chapter 2 Review of Forces and Moments, Brown University, Chapter 2 Review of Forces and Moments 2, 3.2 Vector and Tensor Mathematics, Vector and Tensor Mathematics, Data Manipulation and Basic Settings, National Basketball Association, 1 & 2 SAMUEL, 2 Samuel