Answered: Question No. 3: a) Given are the points…

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

See similar textbooks

Related questions

Question

Question No. 3: a) Given are the points A = (3,4), B = (4,4), C = (4,3), D = (-3,6), E = (-4,-3), F = (-3,-3). Starting from initial clusters Cluster1 = {A} which contains only the point A and Cluster2 = {D} which contains only the point D, run the K-means clustering algorithm and report the final clusters. Use L1 distance as the distance between points which is given by d ((x1, y1), (x2, y2)) = | x1 – x2 | + | y1 – y2 |. Draw the points on a 2-D grid and check if the clusters make sense. You may stop the clustering process if it found that two iterations have the same clusters, otherwise, at least 4 iterations are required. b) Given are the 1-dimensional points A = 2, B = 3, C = 4, D = 9, E = 10, F = 11. Compute complete-linkage hierarchical clustering using d (x, y) = |x – y| as the distance between points. And also draw a dendrogram of it.

Expert Solution

Step by step

Solved in 2 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

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.

Similar questions