786209195_3_HW-Linear-KNN-SVM

786209195_3_HW-Linear-KNN-SVM - Assignments for Linear...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Assignments for Linear Classifiers, and SVM Note: Exercises without “*” are required for everyone. You are welcome to do those with “*” if interested in them, however, they will not be taken into account when giving scores. 1. In the multicategory case, a set of samples is said to be linearly separable if there exists a linear machine that can classify them all correctly. If any samples labeled i ϖ can be separated from all others by a single hyperplane, we shall say the samples are totally linearly separable . Give examples to show that totally linearly separable samples must be linearly separable, but that the converse need not be true. 2. A set of samples is said to be pairwise linearly separable if there exist () 12 cc hyperplanes ij H such that ij H separates samples labelled i from samples j . Give examples to show that a pairwise-linearly-separable set of patterns may not be linearly separable.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 3

786209195_3_HW-Linear-KNN-SVM - Assignments for Linear...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online