Why this method will not only speed up the convergence

Assignment Help Basic Computer Science

Reference no: EM131221670

For the k-means algorithm, it is interesting to note that by choosing the initial cluster centers carefully, we may be able to not only speed up the algorithm's convergence, but also guarantee the quality of the final clustering. The k-means++ algorithm is a variant of k-means, which chooses the initial centers as follows. First, it selects one center uniformly at random from the objects in the data set. Iteratively, for each object p other than the chosen center, it chooses an object as the new center. This object is chosen at random with probability proportional to dist(p) 2 , where dist(p) is the distance from p to the closest center that has already been chosen. The iteration continues until k centers are selected. Explain why this method will not only speed up the convergence of the k-means algorithm, but also guarantee the quality of the final clustering results.

Reference no: EM131221670

Questions Cloud

Describe an alternative approach to instance-based transfer : Semi-supervised classification, active learning, and transfer learning are useful for situations in which unlabeled data are abundant.

Discuss the top national policies for combatting cybercrimes : Discuss the top national policies for combatting cybercrimes. What are the primary agencies that are responsible in preparing for, responding, and recovering from a cyber-attack?

How do the adjustments affect the sizes of booms : How are banks likely to adjust their equity ratios when the riskiness of assets changes? Explain.- How do the adjustments affect the sizes of booms and recessions? Explain.

What was your general emotional state during the day : What helped to create this emotional state? Was there anything that minimized or countered your positive emotional affect? If yes, then what could have been done differently to change this experience?

Why this method will not only speed up the convergence : The iteration continues until k centers are selected. Explain why this method will not only speed up the convergence of the k-means algorithm, but also guarantee the quality of the final clustering results.

Objective function and constraints in linear optimization : Explain the importance of correctly stating the objective function and constraints in linear optimization problems. Using examples from your professional experience, describe the problems that could result if the objective function and constraints..

Does job book come closer to proverbs or ecclesiastes : Job's friends try to be helpful. They kept silent for seven days. Yet Job called them "miserable comforters."Why did Job's friends fail? How many believers today could hold to their integrity like Job did and refuse to admit to crimes they did not..

Do stock prices have some effects that housing prices : Describe all the ways that a rise in stock prices affects aggregate expenditure. - Do stock prices have some effects that housing prices don't or vice versa?

Develop a scalable svm algorithm : The support vector machine is a highly accurate classification method. However, SVM classifiers suffer from slow processing when training with a large set of data tuples. Discuss how to overcome this difficulty and develop a scalable SVM algorithm..

User Account

All Pages