Binary Classifier - Pattern Recognition - Assignment, Exercises of Computer Science

These are the Assignment of Pattern Recognition which includes Squared Mahalanobis, Weighted Version, Squared Euclidean, Dimensional Binary Patterns, Euclidean Distance, Satisfy Symmetry etc.Key important points are: Binary Classifier, Negative Class, Equivalently, Labeled Patterns, One-Dimensional Data Set, Normalize and Transform, Perceptron Learning Algorithm

Typology: Exercises

2012/2013

Uploaded on 03/28/2013

ekanath
ekanath ๐Ÿ‡ฎ๐Ÿ‡ณ

3.8

(4)

76 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Assignment
1. Consider a binary classifier which assigns pattern X to class โ€˜Oโ€™
(positive class) if f (x) > 0 and to class โ€˜Xโ€™ (negative class) if
f (X) < 0, where
f (x) = a + bx + cx2 (37)
Observe, based on the discussion above, that equivalently we can
assign X to โ€˜Oโ€™ if zt Xโ€™ > 0 and to class โ€˜Xโ€™ if zt Xโ€™ < 0, where
Let us consider a set of labeled patterns that are not linearly sep-
arable. Specifically, let us consider the one-dimensional data set
shown in the following table. Normalize and transform the data
and learn the weight vector using perceptron learning algorithm.
2. Consider a two-class two-dimensional dataset given by
Class1 : (1, 2)t, (1, 1)t, (2, 2)t and Class2 : (2, 0)t, (1,โˆ’2)t.
(a) Obtain the support vectors.
(b) What is the Decision Boundary?
Docsity.com
pf2

Partial preview of the text

Download Binary Classifier - Pattern Recognition - Assignment and more Exercises Computer Science in PDF only on Docsity!

Assignment

  1. Consider a binary classifier which assigns pattern X to class โ€˜Oโ€™ (positive class) if f ( x ) > 0 and to class โ€˜Xโ€™ (negative class) if f (X) < 0, where

f (x) = a + bx + cx2 (37)

Observe, based on the discussion above, that equivalently we can assign X to โ€˜Oโ€™ if zt^ Xโ€™ > 0 and to class โ€˜Xโ€™ if zt^ Xโ€™ < 0, where Let us consider a set of labeled patterns that are not linearly sep- arable. Specifically, let us consider the one-dimensional data set shown in the following table. Normalize and transform the data and learn the weight vector using perceptron learning algorithm.

  1. Consider a two-class two-dimensional dataset given by

Class 1 : (1, 2) t , (1, 1) t , (2, 2) t^ and Class 2 : (2, 0) t , (1,โˆ’2) t.

(a) Obtain the support vectors. (b) What is the Decision Boundary?

Docsity.com

(c) What is the width of the margin? (d) What happens to the resulting classifier if we add points (1, 3) t , (2, 3) t from Class1 and (2,โˆ’1) t , (1,โˆ’3) t from Class2?

  1. Consider a one-dimensional data set of 3 points shown in the fol- lowing table. (a) What is the Criterion function to be minimized in the case of SVM? (b) Identify the constraints associated with the problem. (c) What are the corresponding values? (d) Obtain w and b of the SVM in this case. (e) What is the corresponding decision boundary?

Docsity.com