Lecture 13: Linear Discrimination (Cont.)

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 [[http://see.stanford.edu/materials/lsocoee364a/transcripts/ConvexOptimizationI-Lecture13.pdf|Convex Optimization I - Lecture 13]]