Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Suppose that you need to group some data into clusters, and you run K-means 100 times, starting each time from a different random initialisation. You get 100 different clusterings of the data. Which one should you choose? Simply pick one at random. Choose the one that minimises the mean distance of points from the centroid of their allocated cluster. Label the clusters 1, 2, ..., k each time, and assign each point to the cluster it ends up in most often. Choose the clustering you get from the 100th run.

Suppose that you need to group some data into clusters, and you run K-means 100 times, starting each time from a different random initialisation. You get 100 different clusterings of the data. Which one should you choose? Simply pick one at random. Choose the one that minimises the mean distance of points from the centroid of their allocated cluster. Label the clusters 1, 2, ..., k each time, and assign each point to the cluster it ends up in most often. Choose the clustering you get from the 100th run.

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question
Suppose that you need to group some data into clusters, and you run K-means 100 times, starting each time from a different random initialisation. You get 100 different clusterings of the data. Which one should you choose? Simply pick one at random. Choose the one that minimises the mean distance of points from the centroid of their allocated cluster. Label the clusters 1, 2, ..., Choose the clustering you get from the 100th run. k each time, and assign each point to the cluster it ends up in most often.
Transcribed Image Text:Suppose that you need to group some data into clusters, and you run K-means 100 times, starting each time from a different random initialisation. You get 100 different clusterings of the data. Which one should you choose? Simply pick one at random. Choose the one that minimises the mean distance of points from the centroid of their allocated cluster. Label the clusters 1, 2, ..., Choose the clustering you get from the 100th run. k each time, and assign each point to the cluster it ends up in most often.
Expert Solution
steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS