APPLICATION OF SUPERVISED LEARNING
SUPPORT VECTOR MACHINE SVM
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
Can decision trees be used for performing clustering?
|
|
True
|
|
|
False
|
|
|
Either A or B
|
|
|
None of the above
|
Explanation:
Detailed explanation-1: -Can decision trees be used for performing clustering? Decision trees (and also random forests)can also be used for clusters in the data, but clustering often generates natural clusters and is not dependent on any objective function.
Detailed explanation-2: -Answer:As k-means is an iterative algorithm, it guarantees that it will always converge to the global optimum. Explanation: This one is NOT TRUE about k-means clustering-As k-means is an iterative algorithm, it guarantees that it will always converge to the global optimum.
Detailed explanation-3: -Decision Tree is a supervised learning algorithm; k-means clustering is an unsupervised learning algorithm. They are literally apples and oranges.
There is 1 question to complete.