/  Classification Model-quiz-2

This Quiz contains totally 10 Questions each carry 1 point for you.

1. Which of the following techniques can be used for normalization in text mining?

Stemming
Lemmatization
Stop Word Removal
Both 1 and 2

### Wrong!

2. What is pca.components_ in Sklearn?

Set of all eigen vectors for the projection space
Matrix of principal components
Result of the multiplication matrix
None of the above options

### Wrong!

3. How can you prevent a clustering algorithm from getting stuck in bad local optima?

Set the same seed value for each run
Use multiple random initilaizations
Both 1 and 2
None of the above

### Wrong!

4. In which of the following cases will K-means clustering fail to give good results? 1) Data points with outliers 2) Data points with different densities 3) Data points with nonconvex shapes

1 and 2
2 and 3
1,2 and 3
1 and 3

### Wrong!

5. Which of the following is true about Naive Bayes ?

Assumes that all the features in a dataset are equally important
Assumes that all the features in a dataset are independent
Both 1 and 2
None of the above

### Wrong!

6. Which of the following is a reasonable way to select the number of principal components "k"?

Choose k to be the smallest value so that at least 99% of the varinace is retained. - answer
Choose k to be 99% of m (k = 0.99*m, rounded to the nearest integer).
Choose k to be the largest value so that 99% of the variance is retained.
Use the elbow method

### Wrong!

7. Which of the following statements about regularization is not correct?

Using too large a value of lambda can cause your hypothesis to underfit the data.
Using too large a value of lambda can cause your hypothesis to overfit the data.
Using a very large value of lambda cannot hurt the performance of your hypothesis.
None of the above

### Wrong!

8. What is a sentence parser typically used for?

It is used to parse sentences to check if they are utf-8 compliant.
It is used to parse sentences to derive their most likely syntax tree structures.
It is used to parse sentences to assign POS tags to all tokens.
It is used to check if sentences can be parsed into meaningful tokens.

### Wrong!

9. Suppose you have trained a logistic regression classifier and it outputs a new example x with a prediction ho(x) = 0.2. This means

Our estimate for P(y=1 | x)
Our estimate for P(y=0 | x)
Our estimate for P(y=1 | x)
Our estimate for P(y=0 | x)

### Wrong!

10. You run gradient descent for 15 iterations with a=0.3 and compute J(theta) after each iteration. You find that the value of J(Theta) decreases quickly and then levels off. Based on this, which of the following conclusions seems most plausible?

Rather than using the current value of a, use a larger value of a (say a=1.0)
Rather than using the current value of a, use a smaller value of a (say a=0.1)
a=0.3 is an effective choice of learning rate
None of the above

### Subscribe to see your results

Classification Models – Quiz2

%%description%%
%%description%%