Answer this question. Given a set of four points, -2, 0, 1, and 9, we want to use K-Means Clustering with k = 2. If the initial cluster centers are C1 = -4.0 and C2 = 2.0, What will%3Dbe the center C1 after completing first iteration of k means clustering algorithm? Use Manhattan distance as a distance measure x-ylAnswer:

value of C1 after 1st iterations

Given a set of four points, -2, 0, 1, and 9, we want to use K-Means Clustering with k = 2. If the initial cluster centers are C1 =-4.0 and C2 =2.0, What wil be the center C1 after completing first iteration ofk means clustering algorithm? Use Manhattan distance as a distance measure x-yl Answer:

Given a set of four points, -2, 0, 1, and 9, we want to use K-Means Clustering with k = 2. If the initial cluster centers are C1 =-4.0 and C2 =2.0, What wil be the center C1 after completing first iteration ofk means clustering algorithm? Use Manhattan distance as a distance measure x-yl Answer:

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.
Given a graph of friends who have different interests, determine which groups of friends have the most interests in common. Then use a little math to determine a value to return. The graph will be represented as a series of nodes numbered consecutively from 1 to friends_nodes. Friendships have evolved based on interests which will be represented as weights in the graph. Any members who share the same interest are said to be connected by that interest. Once the node pairs with the maximum number of shared interests are determined, multiply the friends_nodes of the resulting node pairs and return the maximal product.
How to use python code to plot linear regression 3D graph?x=[22, 25, 34, 41, 51,59]y=[0.65, 0.67,0.65,0.65,0.8,0.7]z=[182, 178, 147, 119, 111,95]A=np.transpose(np.array([[22, 25, 34, 41, 51,59],[0.65, 0.67,0.65,0.65,0.8,0.7],[1,1,1,1,1,1]]))Make x,y,z corresponding poing intercept at one point[eg point m(22,0.65,182)]
Rohan and his friends kept track of which cities they visited on their Euro trip on a map with 2k cities and k edges, where 2 cities have an edge between them if the group took a direct mode of transportation between them. Rohan noticed that their map had no isolated cities. Show that their map has exactly k connected components (groups of cities all connected via direct mode of transportation).
Consider the following edge-weighted graph G with 9 vertices and 16 edges: 90 Q6.1 Kruskal 0 40 50 80 130 110 70 S 150 60 30 10 120 140 20 100 List the weights of the MST edges in the order that Kruskal's algorithm adds them the MST. Your answer should be a sequence of 8 integers, with one space between each integer, 44
Write a program to find the maximum sum of 7-Item-SubArray-Pair in given 2D-Array.For example, in the following 2D-Array, the maximum sum of 7-Item-SubArray-Pair is highlighted withred selected area, which is the same like this pattern and maximum/largest sum of this selected redarea is 19. Problem Explanation:The naive solution for this problem is to check every possible 7-Item-SubArray-Pair-Pattern in the given2D-Array. Actually there are many pattern of 7-Item-SubArray-Pair in the given 2D-Array.Maximum sum of 7-Item-Pair should be from 3x3 Sub-Array of the given 2D-Array. Total 16 pair of 3x3Sub-Array is following below:
Given N cities represented as vertices V₁, V2, 9 un on an undirected graph (i.e., each edge can be traversed in both directions). The graph is fully-connected where the edge ei, connecting any two vertices vį and vj is the straight-line distance between these two cities. We want to search for the shortest path from v₁ (the source) to vn (the destination). Assume that all edges have different values, and e₁, has the largest value among the edges. That is, the source and destination have the largest straight-line distance. Compare the lists of explored vertices when we run the uniform-cost search and the A* search for this problem. Hint: The straight-line distance is the shortest path between any two cities. If you do not know how to start, try to run the algorithms by hand on some small cases first; but remember to make sure your graphs satisfy the conditions in the question.
Let’s consider there are 6 nodes. The nodes are denoted as A,B,C,D,E,F.The edges are(Remember all the edges are undirected)A->BA->CA->DB->EB->DC->DD->ED->FE->FQ- Draw the graph. Now assign weights.The value of the weights will be my id. my id is 201002259edge values from the starting.For example edge A->B value is 1A->C=2 similarly others and E->F=9From the above graph which you have drawn find the MST using Prim’s algorithm, alsowrite the algorithm and find the complexity using your graph.
TRY YOUR BEST PLEASE Let A and B each be sets of N labeled vertices, and consider bipartite graphs between A and B. 1. Starting with no edges between A and B, if |E| many edges are added between A and B uniformly at random, what is the expected number of perfect matchings in the resulting graph? Hint: if S is a set of edges in a potential perfect matching, let X sub S = 1 if all the edges in S are added to the graph, and X sub S= 0 if any of them are missing. What isE[X sub S]?
Let G = (V, E) be a DAG, where every edge e = ij and every vertex x have positive weighs w(i,j) and w(x), respectively, associated with them. Design an algorithm for computing a maximum weight path. What is the time complexity of your algorithm? (You must start with the correct definitions, and then write a recurrence relation.)
Suppose you are given a connected undirected weighted graph G with a particular vertex s designated as the source. It is also given to you that weight of every edge in this graph is equal to 1 or 2. You need to find the shortest path from source s to every other vertex in the graph. This could be done using Dijkstra’s algorithm but you are told that you must solve this problem using a breadth-first search strategy. Design a linear time algorithm (Θ(|V | + |E|)) that will solve your problem. Show that running time of your modifications is O(|V | + |E|). Detailed pseudocode is required. Hint: You may modify the input graph (as long as you still get the correct shortest path distances).
Mr Fuad is a salesman on a new Algorithm Analysis Textbook published by IIUM Press, he needs to travel around the cities to make this product known. Given a set of cities and distance between every pair of cities, you are required to help Mr. Fuad compute the shortest possible route that he visits every city exactly once and returns to the starting point. Though we can use brute-force approach to evaluate every possible tour and select the best one. For n number of vertices in a graph, there are (n - 1)! number of possibilities. Instead of brute-force, use dynamic programming approach which will help to lessen the computation time. Use the graph in Figure 3 to calculate the shortest path of the journey. Show your work. This path will help Mr Fuad to choose the city he should start and end his journey. а. 10 20 13 15 8. 10 12 Figure 3