Given the following eight points point 1 point 2 point 3 point 4 point 5 point 6 point 7 point 8 (4,1) (7,6) (6,2) (2,4) (5,3) (1,7) (8,5) (3,8) cluster them using the k-means algorithm (all distances are Euclidean) until convergence, i.e. until there is no change in clusters. Assume the parameter k = 3 and the initial cluster centroids are point 1, point 2, and point 3. What is the resulting clustering? O a. {1, 2, 4), (5, 6, 8}, {3,7} O b. {1, 4), (6, 8), (2, 3, 5, 7} O c. none of the proposed answers O d. {4}, {1, 6, 8}, {2, 3, 5, 7} O e. {1}, {4, 6}, {2, 3, 5, 7, 8) O f. {1, 4, 6), (3, 8), (2, 5, 7)
Given the following eight points point 1 point 2 point 3 point 4 point 5 point 6 point 7 point 8 (4,1) (7,6) (6,2) (2,4) (5,3) (1,7) (8,5) (3,8) cluster them using the k-means algorithm (all distances are Euclidean) until convergence, i.e. until there is no change in clusters. Assume the parameter k = 3 and the initial cluster centroids are point 1, point 2, and point 3. What is the resulting clustering? O a. {1, 2, 4), (5, 6, 8}, {3,7} O b. {1, 4), (6, 8), (2, 3, 5, 7} O c. none of the proposed answers O d. {4}, {1, 6, 8}, {2, 3, 5, 7} O e. {1}, {4, 6}, {2, 3, 5, 7, 8) O f. {1, 4, 6), (3, 8), (2, 5, 7)
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
Related questions
Question
![Given the following eight points
point 1 point 2 point 3 point 4 point 5 point 6 point 7 point 8
(4,1) (7,6) (6,2) (2,4) (5, 3) (1,7) (8,5)
(3,8)
cluster them using the k-means algorithm (all distances are Euclidean) until convergence, i.e. until there is no change in clusters. Assume the
parameter k = 3 and the initial cluster centroids are point 1, point 2, and point 3.
What is the resulting clustering?
O a. {1, 2, 4), (5, 6, 8}, {3,7}
O b. {1, 4), (6, 8}, {2, 3, 5, 7}
c. none of the proposed answers
d. {4}, {1, 6, 8}, {2, 3, 5, 7}
O e. {1}, {4, 6}, {2, 3, 5, 7, 8}
O f. {1, 4, 6}, {3, 8}, {2, 5, 7}](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F2585284a-6097-4d2f-a6e7-d4155ef08e72%2F206ef1c2-b6cb-4e61-8322-8f6387445cb0%2Fugdfj26_processed.png&w=3840&q=75)
Transcribed Image Text:Given the following eight points
point 1 point 2 point 3 point 4 point 5 point 6 point 7 point 8
(4,1) (7,6) (6,2) (2,4) (5, 3) (1,7) (8,5)
(3,8)
cluster them using the k-means algorithm (all distances are Euclidean) until convergence, i.e. until there is no change in clusters. Assume the
parameter k = 3 and the initial cluster centroids are point 1, point 2, and point 3.
What is the resulting clustering?
O a. {1, 2, 4), (5, 6, 8}, {3,7}
O b. {1, 4), (6, 8}, {2, 3, 5, 7}
c. none of the proposed answers
d. {4}, {1, 6, 8}, {2, 3, 5, 7}
O e. {1}, {4, 6}, {2, 3, 5, 7, 8}
O f. {1, 4, 6}, {3, 8}, {2, 5, 7}
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Knowledge Booster
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.Recommended textbooks for you
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
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)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
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)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education