Question 7Consider seven points in 1-D, the one-dimensional space.Suppose a partitioning into two clusters C1 and C2 hasbeen obtained by a k-medoids method (i.e., k=2). Let m1and m2 be the representative objects of C1 and C2,respectively, m1 = 23 and m2 = 28. Cluster C, has beenassigned the (non-representative) pointsP1 = 40P2 = 12and cluster C2 the pointsP3 = 6P4 = 9P5 = 34Using the Manhattan distance (i.e., the absolute value ofthe difference between two points) as the dissimilaritymeasure, calculate the absolute error E of the givenpartitioning. Question 8Suppose that the k-medoids algorithm is being used toobtain a partitioning of a dataset of 2-dimensional points.Consider two representative points m1 and m2m1 = (14, 49)m2 = (36, 22).%3D%3DSuppose that p = (6, 53) is currently assigned to thecluster represented by m1. If m2 were replaced by arandom non-representative point r,= (41, 19),would p be assigned to the cluster represented by r, orwould p remain assigned to cluster represented by m1?Assume the Euclidean distance is used as the dissimilaritymeasure.Enter 1 is the answer is p would be assigned to the clusterrepresented by r.Enter O if the answer is p would remain assigned to clusterrepresented by m1.

According to the Bartelby guideline we are suppose to answer only one question at a time. Kindly…

Question 7 Consider seven points in 1-D, the one-dimensional space. Suppose a partitioning into two clusters C1 and C2 has been obtained by a k-medoids method (i.e., k=2). Let m1 and m2 be the representative objects of C1 and C2, respectively, m1 = 23 and m2 = 28. Cluster C1 has been assigned the (non-representative) points %3D P1 = 40 P2 = 12 and cluster C2 the points P3 = 6 P4 = 9 P5 = 34 Using the Manhattan distance (i.e., the absolute value of the difference between two points) as the dissimilarity measure, calculate the absolute error E of the given partitioning.

Question 7 Consider seven points in 1-D, the one-dimensional space. Suppose a partitioning into two clusters C1 and C2 has been obtained by a k-medoids method (i.e., k=2). Let m1 and m2 be the representative objects of C1 and C2, respectively, m1 = 23 and m2 = 28. Cluster C1 has been assigned the (non-representative) points %3D P1 = 40 P2 = 12 and cluster C2 the points P3 = 6 P4 = 9 P5 = 34 Using the Manhattan distance (i.e., the absolute value of the difference between two points) as the dissimilarity measure, calculate the absolute error E of the given partitioning.

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

Similar questions

Consider eight points on the Cartesian two-dimensional x-y plane. a g C For each pair of vertices u and v, the weight of edge uv is the Euclidean (Pythagorean) distance between those two points. For example, dist(a, h) : V4? + 1? = /17 and dist(a, b) = v2? + 0² = 2. Because many pairs of points have identical distances (e.g. dist(h, c) V5), the above diagram has more than one minimum-weight spanning tree. dist(h, b) = dist(h, f) Determine the total number of minimum-weight spanning trees that exist in the above diagram. Clearly justify your answer.
Let G be a graph with n vertices. The k-coloring problem is to decide whether the vertices of G can be labeled from the set {1, 2, ..., k} such that for every edge (v,w) in the graph, the labels of v and w are different. Is the (n-4)-coloring problem in P or in NP? Give a formal proof for your answer. A 'Yes' or 'No' answer is not sufficient to get a non-zero mark on this question.
please explain fully
Consider the following edge-weighted digraph with 8 vertices and 13 edges. V->W weight A->E 1 A->B B->C C->F 4 C->D D->G F->E 39 23 F->B 26 F->A 16 G->F G->C 40 34 H->D 95 H->G 17 Here is a graphical representation of the same edge-weighted digraph: (A) -3---->(B) -39-->(D) 16 95 (E)- -23- (F). 40 (G) (H) Suppose that you run the Bellman-Ford algorithm to compute the shortest paths from H to every other vertex. What is the distTo[] array immediately after the end of three passes of the algorithm (pass 1, 2, and 3)? Each pass consists of relaxing the 13 edges in the order given above. Here is the distTo[] array before the beginning of pass 1: v A B CDE F H. distTo(v] Answer Your answer should be a sequence of 8 integers, separated by whitespace,
Discrete mathematics. Let G = (V, E) be a simple graph4 with n = |V| vertices, and let A be its adjacency matrix of dimension n × n. We want to count the L-cycles : such a cycle, denoted by C = u0u1 · · · uL with uL = u0 contains L distinct vertices u0, . . . , uL-1 et L edges E(C) = {uiui+1 | 0 ≤ i ≤ L − 1} ⊆ E. Two cycles are distinct if the edge sets are different : C = C' if and only if E(C) = E(C'). We define the matrices D, T, Q, the powers of A by matrix multiplication : D = A · A = A2, T = A · D = A3, Q = A · T = A4. Consider the values on the diagonals. Prove that the number of 3-cycles N3 in the whole graph is N3 = 1/6 ∑ u∈V Tu,u
Prove that for any n green and n red points in a plane such that no 3 points are on the same line, it is possible to match each green with one red such that no two segments connecting matched nodes intersect