Part 1: Implementation
You are given two data files - linsep.txt and nonlinsep.txt - each of which contains 100 2D points with classification labels +1 or -1. The first two columns in each file indicate the 2D coordinates of a point; and the third column indicates its classification label. The points in linsep.txt are linearly separable. The points in nonlinsep.txt are not linearly separable in the original space but are linearly separable in a zspace that uses a simple nonlinear transformation.
Part (a) ]: Find the fattest margin line that separates the points in linsep.txt. Please solve the problem using a Quadratic Programming solver. Report the equation of the line as well as the support vectors.
Part (b): Using a kernel function of your choice along with the same Quadratic Programming solver, find the equation of a curve that separates the points in nonlinsep.txt. Report the kernel function you use as well as the support vectors.
You can write your programs in any programming language. However, you will have to implement the algorithms yourself instead of using library functions (except for the Quadratic Programming solver). In your report, please provide a description of the data structures you use, any code-level optimizations you perform, any challenges you face, and of course, the requested outputs.
Part 2: Software Familiarization
Do your own research and find out about library functions relevant to Support Vector Machines. Learn how to use them. Compare them against your implementations and suggest some ideas for how you can improve your code. Describe all this in your report.
Part 3: Applications
Do your own research and describe some interesting applications of Support Vector Machines.
