You want to cluster 7 points into 3 clusters using the k-Means Clusteringalgorithm. Suppose after the first iteration, clusters C1, C2 and C3 contain thefollowing 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?A. C1: (3,3), C2: (4,4), C3: (6,6)B. C1: (3,3), C2: (6,6), C3: (12,12)C. C1: (6,6), C2: (12,12), C3: (12,12)D. C1: (0,0), C2: (48,48), C3: (35,35)E. None of these23. [2] True or False: In general (not for the dataset above), it is possible that after newcluster centers are computed by the k-Means Clustering algorithm, a cluster centermay be associated with an empty cluster (i.e., with zero points in it).24. [2] True or False: To find the best number of clusters, k, to use with k-MeansClustering for a given dataset, you should pick the value of k that minimizes thedistortion measure of cluster quality.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
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?
A. C1: (3,3), C2: (4,4), C3: (6,6)
B. C1: (3,3), C2: (6,6), C3: (12,12)
C. C1: (6,6), C2: (12,12), C3: (12,12)
D. C1: (0,0), C2: (48,48), C3: (35,35)
E. None of these
23. [2] True or False: In general (not for the dataset above), it is possible that after new
cluster centers are computed by the k-Means Clustering algorithm, a cluster center
may be associated with an empty cluster (i.e., with zero points in it).
24. [2] True or False: To find the best number of clusters, k, to use with k-Means
Clustering for a given dataset, you should pick the value of k that minimizes the
distortion measure of cluster quality.

Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Types of trees
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education