9) In supervised learning, the performance of the classifier on the training set is NOT a good indicator ofperformance on an independent test set.10)a) Trueb) Falsehappens when a learning algorithm does not generalize well over unseen data.a) Pruningb) Over-fittingc) Randomizationd) Stratification11) The k-means algorithm is not sensitive to outliers because an instance with an extremely large valuemay not substantially distort the distribution of the dataa) Trueb) False12) Which of the following regarding medoid is NOT true?a) A medoid is the most centrally located object in a clusterb)A medoid is constructed by taking the mean value of the objects in a clusterc)A medoid in a cluster is a real instance13) In recommender systems, usually, implicit feedback comprises afeedback comprises amatrix.a) dense, sparseb) sparse, densematrix, while explicit14) If you are building a recommender system for netflix.com which recommends products leveragingonly explicit ratings, then which algorithm would you use?a) Stochastic Gradient Descentb) Alternating Least Squares15) Which of the following is a limitation of deep learning (DL)?a) DL is not capable of modeling high dimensional and highly non-linear functionsb)DL requires sophisticated feature engineering by expertsc) DL is generally interpretabled)DL is extremely data intensive

Note: As per guidelines I am compelled to solve only one question and that is the first question.…

Answered: 9) In supervised learning, the…

9) In supervised learning, the performance of the classifier on the training set is NOT a good indicator of performance on an independent test set. a) True b) False

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Please solve this question in machine learning quickly
In the context of supervised learning, which of the following statements is not accurate? a) It is a specific category of machine learning b) It doesn't need any response variable at all c) An example of unsupervised learning that involves classification d) None of the options presented
Does building a model in machine learning means making an algorithm to minimise a cost function which computes an error?
Write Top down approach Algorithm in Unsupervised LearningInput: I = {I1, I2, … , In}Output: O
Question 47. Random forests are one of the most famous machine learning methods. They are easy to understand, easy to implement and reach good prediction performances even without a hyper-parameter tuning. Which of the following statements on random forest are correct? a) The prediction of a classification forest is made by a majority vote of the trees' predictions. b) The prediction of a regression forest is the median of the tree predictions. c) Each single tree in the forest uses only a part of the data available. d) The training time of a random forest scales linear with the number of trees used.
Question 47.Random forests are one of the most famous machine learning methods. They are easy to understand,easy to implement and reach good prediction performances even without a hyper-parameter tuning. Which of thefollowing statements on random forest are correct?a) The prediction of a classification forest is made by a majority vote of the trees’ predictions.b) The prediction of a regression forest is the median of the tree predictions.c) Each single tree in the forest uses only a part of the data available.d) The training time of a random forest scales linear with the number of trees used.
T or F
Answer this questions True or False : Q1:lf the learning rate is too small, then gradient descent may take a very long time to converge. Q2: If 00 and 01 are initialized at a local minimum, then one iteration will not change their values Q3: If 00 and 01 are initialized so that 00=01, then by symmetry (because we do simultaneous updates to the two parameters), after one iteration of gradient descent, we will still have 00=01
Write Algorithm for Synchronized simulation for Guess a Number.in: set of human participants H; set of computer participants Cout: winner wconstant: minimum number nmin; maximum number nmaxlocal: guessed number g
Appendix A 10-Fold Cross Validation for Parameter Selection Cross Validation is the standard method for evaluation in empirical machine learning. It can also be used for parameter selection if we make sure to use the training set only. To select parameter A of algorithm A(X) over an enumerated range d E [A1,..., A] using dataset D, we do the following: 1. Split the data D into 10 disjoint folds. 2. For each value of A e (A1,..., Ar]: (a) For i = 1 to 10 Train A(A) on all folds but ith fold Test on ith fold and record the error on fold i (b) Compute the average performance of A on the 10 folds. 3. Pick the value of A with the best average performance Now, in the above, D only includes the training data and the parameter A is chosen without the knowledge of the test data. We then re-train on the entire train set D using the chosen A and evaluate the result on the test set.
2. Why would you prefer to use reinforcement learning to implement a player in a board game rather than the mini-max algorithm?
Backpropagation learning 1 f(w, x) = %3D 1+e-(Woxo+W1X1+W2)