Lecture 13: Linear Discrimination (Cont.)
author: Stephen P. Boyd,
Department of Electrical Engineering, Stanford University
published: Aug. 17, 2010, recorded: January 2008, views: 3007
released under terms of: Creative Commons Attribution Non-Commercial (CC-BY-NC)
published: Aug. 17, 2010, recorded: January 2008, views: 3007
released under terms of: Creative Commons Attribution Non-Commercial (CC-BY-NC)
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.
Description
Okay. We’ll continue with our whirlwind tour of applications in – they’re geometric. Last time we started looking at this, at the basic linear discrimination problem. By the way, this is very old. This goes into the 40s, this topic. And we ask the question when can a bunch of points labeled? I’ve labeled them by changing the symbol from X to Y. So I have binary labels on data in our end. And the question is when can they be separated by a hyperplane? This problem goes back to the 40s. ...
See the whole transcript at Convex Optimization I - Lecture 13
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: