The K-means algorithm: – McqOptions

MCQOPTIONS

1.	The K-means algorithm:
A.	requires the dimension of the feature space to be no bigger than the number of samples
B.	has the smallest value of the objective function when k = 1
C.	minimizes the within class variance for a given number of clusters
D.	converges to the global optimum if and only if the initial means are chosen as some of the samples themselves
Answer» D. converges to the global optimum if and only if the initial means are chosen as some of the samples themselves

Discussion

No Comment Found

Related MCQs

scikit-learn offers the classÂ Â Â Â Â Â Â Â Â Â Â , which is responsible for filling the holes using a strategy based on the mean, median, or frequency
scikit-learn also provides a class for per- sample normalization,
Â Â Â Â Â Â Â Â Â Â Â dataset with many features contains information proportional to the independence of all features and their variance.
In order to assess how much information is brought by each component, and the correlation among them, a useful tool is theÂ Â Â Â Â Â Â Â Â .
In reinforcement learning if feedback is negative one it is defined as____.
What is â€˜Training setâ€™?
Common deep learning applications include____
According to____ , itâ€™s a key success factor for the survival and evolution of all species.
if there is only a discrete number of possible outcomes (called categories), the process becomes a______.
Reinforcement learning is particularly efficient when______________.