Suppose we cluster a set of N data points using two different using the k-means clustering algorithm runs but with different number of initial clusters centres. Run 1: 4 initial cluster centres - (a,b), (c,d), (e,f) and (g,h). Run 2: 2 initial cluster centres - (a,b), (c,d) Run 3: 3 initial cluster centres - ((a,b), (c,d), (e,f). Would the clusters created using Run 3 be similar to the 2 or 4 initial cluster runs? Explain your answer briefly.

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

Suppose we cluster a set of N data points using two different using the k-means clustering
algorithm runs but with different number of initial clusters centres.
Run 1: 4 initial cluster centres - (a,b), (c,d), (e,f) and (g,h).
Run 2: 2 initial cluster centres - (a,b), (c,d)
Run 3: 3 initial cluster centres - ((a,b), (c,d), (e,f).
Would the clusters created using Run 3 be similar to the 2 or 4 initial cluster runs? Explain
your answer briefly.

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Counting Problems
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