Write algorithm which divides n objects of u into k clusters

Assignment Help Data Structure & Algorithms
Reference no: EM1370538

You are given a set U of n objects labeled p1, p2, . . . , pn. A distance function d(pi, pj) provides a numeric value measuring the "closeness" of two objects pi, pj, where 1  i, j  n. You are asked to make use of this distance function to divide the n objects into k clusters, where k is a given parameter. You can think of a cluster as a subset of U, where objects in a cluster are "closer" to one another than to objects in another cluster. Propose an algorithm that divides the n objects of U into k clusters, making use of the MST of a graph. Provide a simple argument of correctness and a bound on the running time of the algorithm you are proposing.

Reference no: EM1370538

Questions Cloud

Questions based on corporate governance : Recent corporate governance concepts have redefined the responsibilities of management to ensure greater protection and accountability of management to the relevant stakeholders.
Write a xquery which returns all concert titles : Write a XQuery which returns all concert titles whose type is chamber orchestra where average ticket price is at least $50.
Determine the size in aggregate expenditure line : Suppose the simple spending multiplier equals 10. Estimate the size and direction of any shifts in the aggregate expenditure line, the level of real GDP demanded,
What is the monopolist profit maximizing level of output : Assume a monopolist faces the following demand curve: P = 180 - 4Q. Marginal cost of production is stable and equal to $20, and there're no fixed costs. What is the monopolist's profit maximizing level of output?
Write algorithm which divides n objects of u into k clusters : Suggest the algorithm which divides n objects of U into k clusters, making use of MST of a graph. Give a simple argument of correctness and bound on the running time of the algorithm you are proposing.
How market structure affects market performance : Describe how market structure affects market performance and conduct. Recognize three types of government regulation that aid to enhance market performance
Effectiveness of control mechanisms within starbucks : Evaluate the effectiveness of these control mechanisms (ways controls are applied) in Starbucks and examine the positive and negative reactions to the use of these controls in Starbucks.
Create database management system for bike shop : Your job is to create a database management system for bike shop who ‘buys' and ‘sells' new and second-hand bikes, and also parts of bike. Bike is constructed with parts while part can be fitted to different bikes.
Explain what are arrival rate and service rate : Explain what are the arrival rate and the service rate - Analyze fast food drive-through window: What are the arrival rate and the service rate?

Reviews

Write a Review

Data Structure & Algorithms Questions & Answers

  Create algorithm to calculate union of two input sets-array

Create algorithm to calculate union of two input sets given as arrays, both of size O(n). The output must be array of distinct elements that form union of the sets.

  Implementation of graph

Give the two input nodes after the graph has been built from the command prompt.

  Calculate worst-case run-time complexity of algorithm

Calculate the worst-case run-time complexity of your algorithm and prove optimality of the solution it gives. Suppose that the road is a straight line with a western end and an eastern end.

  Write recursive version of array-based linear search

Write an algorithm but not code. Write a recursive version of the array-based linear search algorithm. Write a recursive version of the linked-list-based linear search algorithm."""

  Online vs. face-to-face classes

Communication A significant distinction between online and face-to-face classes lies in the area of communication.

  Determining entropy of encrypted message

If this message is encrypted with DES by using a random 56-bit key, determine encrypted message's entropy?

  Create efficient algorithm to find path in graph

Given connected undirected graph G described by the adjacency list representation create the efficient algorithm to find the path in G which goes through exactly once in each direction.

  Calculate the cost of sorting relation in seconds

Assume a flash storage device is used instead of disk, and it has seek time of 1 microsecond and transfer rate of 40 MB per second. Recompute the cost of sorting the relation in seconds.

  Explain good algorithms to solve character pathfinding

You are working on the new computer game. One of implementation problems you are trying to solve is character pathfinding. What algorithms would be good to use and explain why?

  Write algorithm to prompt for and accept four numbers

Write the algorithm which will prompt for and accept four numbers, sort them into ascending sequence and display them to screen. Your algorithm is to include module called Order _two_numbers.

  Determine the branching factor

Expalin the search algorithm that results from each of the following special cases. How does it relate to other algorithms we have discussed.

  Compare the average behavior of insertion sort

Compare the average behavior of insertion sort for n elements with that of the n insertions into an initially-empty straight array implementation of a priority queue

Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd