Lecture 8 | Machine Learning (Stanford)
Lecture by Professor saint Ng for Machine Learning (CS 229) in the businessman Computer Science department. Professor Ng continues his reproval most hold agent machines, including fleecy edge improvement and kernels. This instruction provides a panoptic launching to organisation acquisition and statistical ornament recognition. Topics allow supervised learning, unattended learning, acquisition theory, approval acquisition and reconciling control. Recent applications of organisation learning, much as to robotic control, accumulation mining, free navigation, bioinformatics, style recognition, and book and scheme accumulation processing are also discussed. Complete Playlist for the Course: www.youtube.com CS 229 Course Website: www.stanford.edu businessman University: www.stanford.edu businessman University Channel on YouTube: www.youtube.com
Related Posts
Comments
Comment from grunder20
Time February 11, 2012 at 10:53 am
This video is on the extent of use of information/.
Comment from grunder20
Time February 11, 2012 at 11:17 am
amazing lecture!
Comment from kmmbvnr
Time February 11, 2012 at 12:12 pm
@bloom987654322 too late, but i just want to check my conjecture: Is phi(x) for Gaussian just Taylor series for exponent?
Comment from horiac
Time February 11, 2012 at 12:28 pm
A good PDF of this lesson: goo*gl/3Jcc3
replace * with .
Comment from bloom987654322
Time February 11, 2012 at 12:35 pm
Does anyone know how to findthe phi(x) corresponding to Gaussian kernel? This is needed if we want to calculate w after solving the soft margin optimization problem.
Comment from timmurfy
Time February 11, 2012 at 12:50 pm
this is phat
Comment from PatriciaHoffmanPhD
Time February 11, 2012 at 1:07 pm
Continues discussion of Soft Margin Support Vector Machine
Coordinate Assent Algorithm starts at 46
Comment from olivermitevski
Time February 11, 2012 at 1:35 pm
1:13:00 I need to come back to it.
Comment from 1888junkteam
Time February 11, 2012 at 2:13 pm
excellent work!
Comment from lovelplants
Time February 11, 2012 at 9:56 am
cool.. that’s nice