Suppose we find K clusters using Ward’s method, bisecting K-means, and ordinary K-means. Which of these solutions represents a local or global minimum? Explain.
What will be an ideal response?
Although Ward’s method picks a pair of clusters to merge based on mini-
mizing SSE, there is no refinement step as in regular K-means. Likewise,
bisecting K-means has no overall refinement step. Thus, unless such a refine-
ment step is added, neither Ward’s method nor bisecting K-means produces
a local minimum. Ordinary K-means produces a local minimum, but like the
You might also like to view...
___________ provides the basic attributes and behaviors of a window—a title bar at the top of the window, and buttons to minimize, maximize and close the window.
a. JLabel. b. JFrame. c. JSwing. d. JWindowControl.
____ is a generic term for a variety of grayscale images printed with the addition of one, two, three, or four inks.
a. Duotone b. Sepia c. Quadtone d. PANTONE
One of the main downsides to virtualization is the potential single point of failure
a. true b. false
Are computer-to-computer authentications subject to the weakness of replay? Why or why not?
What will be an ideal response?