give the steps by steps answer 2. Given a two-category classification problem under the univariate case, wherethere are two training sets (one for each category) as follows:D₁ = (-3,-1,0,4}D₂ = {-2,1,2,3,6,8}Given the test example x = 5, please answer the following questions:haveanda) Assume that the likelihood function of each category has certain paramétricform. Specifically, wep(x | w₁) N, 07)p(x₂)~ N(μ₂, 02). Which category should we decide on whenmaximum-likelihood estimation is employed to make the prediction?b) Following the above assumption, suppose we further know that o = 2, 02= 1, ₁ ~ N(0, 1) and 2~ N(2, 1). Which category should we decideon t when Bayesian estimation is employed to make the prediction?c) Assume that the likelihood function of each category doesn't have anyparametric form. Furthermore, the window function for either category takesthe form of N(0, 1), while the window width for ₁ and is 2 and 5respectively. Which category should we decide on x when Parzen windowsis employed to make the prediction?

In statistical classification and pattern recognition, various estimation and prediction techniques…

Given a two-category classification problem under the univariate case, where there are two training sets (one for each category) as follows: D₁ = {-3,-1,0,4} D₂ = {2,1,2,3,6,8} Given the test example x = 5, please answer the following questions: =) Assume that the likelihood function of each category has certain parametric form. Specifically, we and p(x|w₂) have p(x|w₁) N(₁7) N(2, 2). Which category should we decide on when maximum-likelihood estimation is employed to make the prediction? ) Following the abou

Given a two-category classification problem under the univariate case, where there are two training sets (one for each category) as follows: D₁ = {-3,-1,0,4} D₂ = {2,1,2,3,6,8} Given the test example x = 5, please answer the following questions: =) Assume that the likelihood function of each category has certain parametric form. Specifically, we and p(x|w₂) have p(x|w₁) N(₁7) N(2, 2). Which category should we decide on when maximum-likelihood estimation is employed to make the prediction? ) Following the abou

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter13: Decision Making Under Uncertainty

Section: Chapter Questions

Problem 8RP

See similar textbooks

Similar questions

3. Consider a training set that contains 100 positive examples and 400 negative examples. Foreach of the following candidate rules,R1: A −→ + (covers 4 positive and 1 negative examples), R2: B −→ + (covers 30 positive and 10 negative examples),R3: C −→ + (covers 100 positive and 90 negative examples),determine which is the best and worst candidate rule according to:(a) The likelihood ratio statistic.
Suppose you are using a Linear SVM classifier with 2 class classification problem. Now you have been given the following data in which some points are circled red that are representing support vectors. a) Draw the decision boundary of linear SVM. Give a brief explanation. b) Suppose instead of SVM, we use regularized logistic regression to learn the classifier circle the points such that removing that example from the training set and running regularized logistic regression, we would get a different decision boundary than training with regularized logistic regression on the full sample . why ?
We are intrested in predicting the percentage of people commuting to work by walking given some input variables. Each observation corresponds to a different city and each input variable summarizes some characteristic of a given city, such as density, urban sprawl and average income per capita. This is 1. not a machine learning problem. Only social scientists would be interested in such a problem. 2. both a classification and a regression problem as it depends on the way one codes the output variable as either 0, 1 or a a particular number in the [0,1] interval. 3. a regression problem. The output variable is continuous. 4. a classification problem. Walking to work is a discrete variable and can only take two values: to walk to work and not to walk to wor
it is known that a natural. law obeys the quadratic relationship y=ax^2.what is the best line of form y=px+q that can be used to model data and minimise Mean-squared-error, if all of the data points are drawn uniformly at random from the domain [0,1]?
Linear regression aims to learn the parameters 7 from the training set D = {(f(),y(i)), i {(x(i),y(i)),i = 1,2,...,m} so that the hypothesis ho(x) = ēr i can predict the output y given an input vector š. Please derive the least mean squares and stochastic gradient descent update rule, that is to use gradient descent algorithm to update Ô so as to minimize the least squares cost function JO).
Why don't we use the ordinary least square to learn a linear regression model for a classification problem (i.e., learning to fit the label of 0 or 1)? Select one: a. Linear regression cannot output value in a probability range. b. OSL will learn a bad linear regression model for a classification. c. Yes, we can. Linear regression is the same as logistic regression. d. Linear regression outputs continuous variable.
This is an Uncertainty problem. Given the attached table of some probabilities values of a ‘Medical Knowledge-based System’, evaluate ALL posterior probabilities of event, ‘Heart-Attack’ with given hypothesis. Hint: Use Bayesian Theorem
Consider the training set given below for predicting lung cancer in patients based on their symptoms (chronic cough and weight loss) and other lifestyle and environmental attributes (tobacco smoking and expo- sure to radon). a) Draw a two-level decision tree obtained using entropy as the impurity measure. Show your steps clearly (i.e., the computation of information gain for every candidate attribute at the first and second levels of the decision tree must be shown).
4. What are the differences between L2 and L1 regularization? For a given linear decision (w,b), calculate the value of the L2 and L1 penalty 5. Describe majorization-minimization and gradient descent 6. Describe the proximal gradient descent method: what is the gradient step? What is the proximal step? For a set Q={x : ||x||<=1} in 2D space, what is the result of ProxQ(y) where a) y=[0.5,0.2]; b) y=[2,0]
1. What is a decision boundary in two-class classification problems? In a linear classifier with a given (w,b), what is the formula for the decision boundary? 2. What is maximum likelihood estimation? Show that average is the maximum likelihood estimation of the mean for Gaussian data 3. Describe several loss functions you know, and discuss their positive/negative characteristics
I need help to solve problem Manually fit a linear function h_(\theta )(vec(x))=vec(\theta )^(T)*vec(x) based on the following training instances using the stochastic gradient descent algorithm. The initial values of parameters are \theta _(0)=0.1,\theta _(1)=0.1,\theta _(2)=0.1. The learning rate \alpha is 0.1. Please update each parameter at least five times.X_1,X_2,Y 0 0 20 1 31 0 31 1 4
GD algorithm Consider Linear Regression with single variable (univariate) problem. What will be the (approximate if can’t say accurately) values of derivatives of cost/loss function ‘J’ w.r.t. all the parameters by considering one at a time, and why? What is the significance and/or usage of these θj* for the cost function ‘J’ and hypothesis ‘h’? Given a dataset where first column is the label ‘y’ while other columns represent factors ‘xi’ as follows: X = [ 1 0 1 0 1 0 ] Using GD algorithm, find the linear model. Show all the calculations