Question: 3. (a)Derive an expression for the discriminant function g(x) for a 2-class minimum- distance-to-class-means classifier, based on Euclidean distance, for class means and u,. Is

3. (a)Derive an expression for the discriminant function g(x) for a 2-class minimum- distance-to-class-means classifier, based on Euclidean distance, for class means and u,. Is the classifier linear? Continuing from part (a), for the following class means (b) Plot the decision boundaries and label the decision regions Note: Parts (c) and (d) below use the maximal value (or "linear machine") method for multiclass classification. This method is described briefly in the reading (DHS Sec 5.2.2) and in Discussion 3. It will also be covered in more detail in Lecture 6 (Week 4) on Monday (c) Repeat part (a) except for a 3-class classifier, using the maximal value method: find the three discriminant functions g), 82),83), given three class means ' ', and 2. Express in simplest form. Is the classifier linear? Continuing from part (c), for the following class means (d) Plot the decision boundaries and label the decision regions 3. (a)Derive an expression for the discriminant function g(x) for a 2-class minimum- distance-to-class-means classifier, based on Euclidean distance, for class means and u,. Is the classifier linear? Continuing from part (a), for the following class means (b) Plot the decision boundaries and label the decision regions Note: Parts (c) and (d) below use the maximal value (or "linear machine") method for multiclass classification. This method is described briefly in the reading (DHS Sec 5.2.2) and in Discussion 3. It will also be covered in more detail in Lecture 6 (Week 4) on Monday (c) Repeat part (a) except for a 3-class classifier, using the maximal value method: find the three discriminant functions g), 82),83), given three class means ' ', and 2. Express in simplest form. Is the classifier linear? Continuing from part (c), for the following class means (d) Plot the decision boundaries and label the decision regions
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
