benchmarks.wiki / Public workspace

MMLU / You want to cluster 7 points into 3 clusters using the k-Means Clustering…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

question

You want to cluster 7 points into 3 clusters using the k-Means Clustering algorithm. Suppose after the first iteration, clusters C1, C2 and C3 contain the following two-dimensional points: C1 contains the 2 points: {(0,6), (6,0)} C2 contains the 3 points: {(2,2), (4,4), (6,6)} C3 contains the 2 points: {(5,5), (7,7)} What are the cluster centers computed for these 3 clusters?

choices

  1. C1: (3,3), C2: (4,4), C3: (6,6)
  2. C1: (3,3), C2: (6,6), C3: (12,12)
  3. C1: (6,6), C2: (12,12), C3: (12,12)
  4. C1: (0,0), C2: (48,48), C3: (35,35)

subject

college_computer_science

Discussion

Discussion

No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

Source and history

Official source

initial import