Question: B . 1 , 2 and 3 C . 1 , 2 and 4 D . All of the above Solution: ( D ) Q

B.1,2 and 3
C.1,2 and 4
D. All of the above
Solution: (D)
Q3. Which of the following the following clustering algorithms
suffers from the problem of convergence at local optima?
K-Means clustering algorithm.
Hierarchy clustering algorithm.
Expectation-Maximization clustering algorithm.
Gaussian Mixture Model clustering algorithm.
Options:
A.1 only
B.2 and 3
C.3 and 4
D.1,3 and 4
Solution: (D)
Q4. How can Clustering (Unsupervised Learning) be used
improve the accuracy of the Linear Regression model
(Supervised Learning)?
Creating an input feature for cluster ids as an ordinal variable.
Creating an input feature for cluster centroids as a continuous variab
Creating an input feature for cluster size as a continuous variable.
 B.1,2 and 3 C.1,2 and 4 D. All of the above

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!