Verified Learners _ Final Quiz _ ISYE6501x Courseware _ edX - Solution.

Course Final Q… Final Q… Verifie… Verified Learners 180 Minute Time Limit Instructions Work alone. Do not collaborate with or copy from anyone else. You may use any of the following resources: Two sheets (both si ...

Course Final Q… Final Q… Verifie… Verified Learners 180 Minute Time Limit Instructions Work alone. Do not collaborate with or copy from anyone else. You may use any of the following resources: Two sheets (both sides) of handwritten (not photocopied or scanned) notes Blank scratch paper and pen/pencil If any question seems ambiguous, use the most reasonable interpretation (i.e. don't be like Calvin): Good Luck! This the beginning of the Final Quiz. Please make sure that you submit all your answers before the time runs out. Once you submit an answer to a question, you cannot change it. There is no overall Submit button. Information for Question 1 There are eight questions labeled "Question 1." Answer all eight questions. For each of the following eight questions, select the type of problem that the model is best suited for. For each question there may be more than one correct answer; you need only choose one. Each type of problem might be used zero, one, or more than one time in the eight questions. Question 1 0.0/0.5 points (graded) Select the type of problem that stepwise regression is best suited for. There may be more than one correct answer; you need only choose one. You have used 1 of 1 attempt Answers are displayed within the problem Question 1 0.0/0.5 points (graded) Select the type of problem that k-nearest-neighbor is best suited for. There may be more than one correct answer; you need only choose one. You have used 1 of 1 attempt Answers are displayed within the problem Question 1 0.5/0.5 points (graded) Select the type of problem that logistic regression is best suited for. There may be more than one correct answer; you need only choose one. You have used 1 of 1 attempt Answers are displayed within the problem Question 1 0.5/0.5 points (graded) Select the type of problem that ARIMA is best suited for. There may be more than one correct answer; you need only choose one. You have used 1 of 1 attempt Answers are displayed within the problem Question 1 0.5/0.5 points (graded) Select the type of problem that k-means is best suited for. There may be more than one correct answer; you need only choose one. You have used 1 of 1 attempt Answers are displayed within the problem Question 1 0.5/0.5 points (graded) Select the type of problem that a support vector machine is best suited for. There may be more than one correct answer; you need only choose one. You have used 1 of 1 attempt Answers are displayed within the problem Question 1 0.5/0.5 points (graded) Select the type of problem that linear regression is best suited for. There may be more than one correct answer; you need only choose one. You have used 1 of 1 attempt Answers are displayed within the problem Question 1 0.5/0.5 points (graded) Select the type of problem that GARCH is best suited for. There may be more than one correct answer; you need only choose one. You have used 1 of 1 attempt Answers are displayed within the problem Information for Question 2 There are eight questions labeled "Question 2." Answer all eight questions. For each of the following eight questions, select the type of analysis that the model is best suited for. For each question there may be more than one correct answer; you need only choose one. Each type of analysis might be used zero, one, or more than one time in the eight questions. Question 2 0.625/0.625 points (graded) Select the type of analysis that k-nearest-neighbor classification is best suited for. There may be more than one correct answer; you need only choose one. You have used 1 of 1 attempt Answers are displayed within the problem Question 2 0.625/0.625 points (graded) Select the type of analysis that a support vector machine is best suited for. There may be more than one correct answer; you need only choose one. You have used 1 of 1 attempt Answers are displayed within the problem Question 2 0.625/0.625 points (graded) Select the type of analysis that a k-nearest-neighbor classification tree is best suited for. There may be more than one correct answer; you need only choose one. You have used 1 of 1 attempt Answers are displayed within the problem Question 2 0.0/0.625 points (graded) Select the type of analysis that a linear regression tree is best suited for. There may be more than one correct answer; you need only choose one. You have used 1 of 1 attempt Answers are displayed within the problem Question 2 0.625/0.625 points (graded) Select the type of analysis that a logistic regression tree is best suited for. There may be more than one correct answer; you need only choose one. You have used 1 of 1 attempt Answers are displayed within the problem Question 2 0.0/0.625 points (graded) Select the type of analysis that a random linear regression forest is best suited for. There may be more than one correct answer; you need only choose one. You have used 1 of 1 attempt Answers are displayed within the problem Question 2 0.625/0.625 points (graded) Select the type of analysis that linear regression is best suited for. There may be more than one correct answer; you need only choose one. You have used 1 of 1 attempt Answers are displayed within the problem Question 2 0.625/0.625 points (graded) Select the type of analysis that a random support vector machine forest is best suited for. There may be more than one correct answer; you need only choose one. You have used 1 of 1 attempt Answers are displayed within the problem Question 3 3.0/4.0 points (graded) Select all of the following that are examples of time-series data. You have used 1 of 1 attempt Answers are displayed within the problem Question 4 1.0/4.0 points (graded) Select all of the following reasons that data should not be scaled until point outliers are removed. You have used 1 of 1 attempt Answers are displayed within the problem Question 5 3.0/4.0 points (graded) Select all of the following situations in which using a variable selection approach like lasso or stepwise regression would be important. You have used 1 of 1 attempt Answers are displayed within the problem Information for Question 6 There are four questions labeled "Question 6." Answer all four questions. For each of the following four questions, select the type of model that the software package is best suited for analyzing. Each type of model might be used zero, one, or more than one time in the four questions. Question 6 0.0/1.0 point (graded) Which type of model is ARENA best suited for? You have used 1 of 1 attempt Answers are displayed within the problem Question 6 0.0/1.0 point (graded) Which type of model is SimPy best suited for? You have used 1 of 1 attempt Answers are displayed within the problem Question 6 1.0/1.0 point (graded) Which type of model is PuLP best suited for? You have used 1 of 1 attempt Answers are displayed within the problem Question 6 0.0 /1.0 point (graded) Which type of model is R best suited for? You have used 1 of 1 attempt Answers are displayed within the problem Question 7 6/7 points (graded) Keyboard Help For each of the analytics tasks listed below, drag to it the R function(s) that do it. If there is a function that does not do any of the tasks below, then don't drag it anywhere; all other functions should be used. You have used 1 of 1 attempts. Reset Show Answer Question 8 2.0100000000000002/3.0 points (graded) The following process was followed to predict sales of a product each month for the next three years: 1. Split past sales data randomly into three sets: training, validation, and test. 2. Build 20 different models using the training data. 3. Evaluate all 20 models on the validation data. 4. Select the model that performed best on the validation data. 5. Evaluate the selected model on the test data. 6. Use the selected model to predict monthly sales for the next three years based on real-time data, and observe its true performance. ..............................................................................................continued..................................................................................