M

Mr. Dubey • 52.33K Points
Coach 

Q. SVM is a algorithm

  • (A) classification
  • (B) clustering
  • (C) regression
  • (D) all

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs on Machine Learning

Q. The other name for Comet is

Q. Which of the following is the default positioning elements with CSS?

Q. Given that we can select the same feature multiple times during the recursive partitioning of the input space, is it always possible to achieve 100% accuracy on the training data (given that we allow for trees to grow to their maximum size) when building decision trees?

Q. The main disadvantage of maximum likelihood methods is that they are . . . . . . . .

Q. The K-means algorithm:

Q. Which node type represents the root-node of the DOM tree?

Q. We usually use feature normalization before using the Gaussian kernel in SVM. What is true about feature normalization? 1. We do feature normalization so that new feature will dominate other 2. Some times, feature normalization is not feasible in case of categorical variables 3. Feature normalization always helps when we use Gaussian kernel in SVM

Q. In the regression equation Y = 75.65 + 0.50X, the intercept is

Q. What is/are true about ridge regression? 1. When lambda is 0, model works like linear regression model 2. When lambda is 0, model doesn't work like linear regression model 3. When lambda goes to infinity, we get very, very small coefficients approaching 04. When lambda goes to infinity, we get very, very large coefficients approaching infinity.

Q. In a real problem, you should check to see if the SVM is separable and then include slack variables if it is not separable.

Learn All Machine Learning MCQs

Question analytics