Problem 6: [30pts] Dynamic Programming for k-Mean Square Clustering

Let X = (x1, x2, . . . , xn) be a sequence of reals.

The problem is to partition X into k non-overlapping subsequences so as to minimize the sum of the total mean square error over all of the subsequences.

This is a common first-step in approximating large data sequences.

As an example, the diagram below shows two ways of partitioning the same sequence of 8 items into three subsequences. The one on the right has a smaller mean-square error cost. In fact, the partition on the right provides the minimum cost over all possible 3-partitions

i |
1 |
2 |
3 |
4 |
5 |
6 |
7 |
8 |

xi |
6 |
0 |
-6 |
0 |
-6 |
12 |
-6 |
6 |

I1 = (0, 3, 6, 8)

x¯1,3 = 0 x¯4,6 = 2 x¯7,8 = 0

MSC(1, 3) = 62 + 02 + 62 = 72

MSC(4, 6) = 22 + 82 + 102 = 168

MSC(7, 8) = 62 + 62 = 72

M3(I1) = 72 + 168 + 72 = 312

The formal definitions are below:

- A k-partition of X is a partition of the sequence into k subsequences via index list I = (i0, i1, . . . , ik).

I satisfies i0 = 0, ik = n and i0 < i1 < i2 < · · · < ik. [xt−1 + 1, xt] is the tth interval of the partition.

In is the set of all k-partitioning index lists for [1 . . . n]

Given index list I, the k-Cost MSΣCk(I) of X is the sum of the MSC’s

The problem is to find the partition that minimizes MSCk(I) over all pos- sible partitions. More specifically use Dynamic Programming to find

OPTk(X) = min MSCk(I)Set Xm = (x1, x2, . . . , xm) .

In the example on the previous page X4 = (6, 0, −6, 0).

For 1 ≤ t ≤ k and 1 ≤ m ≤ n define

M(m : t) = OPTt(Xm).

This is the (minimum) cost of the best t-partition for Xm. Note that

OPTk(Xn) = M (n : k), so filling in the M (m : t) table solves the problem.

- First, describe how to preprocess X in O(n) time so that, after the preprocessing, MSC(i, j) can be calculated in O(1) time, for any i, j

- Write down a recurrence relation for M (m : t) with 1 ≤ t ≤ k and 1 ≤ m ≤ You should write your recurrence relation in the form

M (m : t) =MSC(1, m) if t = 1.

?????????????? otherwise

- Prove the correctness of the recurrence relation for part (b).
- Give documented pseudocode for an algorithm for calculating M (n :

k), based on your recurrence relation from (b).

Your code may assume that you have a procedure for calculating

MSC(i, j) in O(1) time (even if you did not solve part (a)).

Analyze the running time of your algorithm. For full marks, your algorithm should run in O(kn2) time.

Data structures & Algorithms

93 Answers

Data structures & Algorithms

49 Answers

DescriptionIn this final assignment, the students will demonstrate their ability to apply two majorconstructs of the C programming language – Functions and Arrays – to solve computationalproblems.Arrays provide a convenient way to store &

The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is anPath finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going through certain obstacles. As the main aim is to thinkabout path finding, we focus on the common task

Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individualDevelop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. TheLineItem class will represent an individual line item of merchandise that acustomer is purchasing.

SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define: SeaPortProgram e

Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define: SeaPortProgram e

The first programming project involves writing a program that parses, using recursive descent, a GUI definition language defined in an input file and generates the GUI that it defines. The grammar for this language is defined below:1Project 1The first programming project involves writing a program that parses, using recursive descent, a GUIdefinition language defined in an input file and generates the GUI that it defines. The grammar for thislanguage is defined below:gui ::= Wi

CMSC 335 Project SeaPort Solved Project 3 Introduction the SeaPort Project series For this set of projects for the course we wish to simulate some of the aspects of a number of Sea PortsCMSC 335 Project SolvedProject 3 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

CMSC 335 Project 4 Solved SeaPort Introduction the SeaPort Project series For this set of projects for the course we wish to simulate some of the aspects of a number of Sea Ports Here are the classes and their instance variables we wish to defineProject 4 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define: SeaPortProgram ext

CMSC 451 Project 2 Solved The second project involves completing and extending the C++ program that evaluates statements of an expression language contained in the module 3 case studyProject 2 The second project involves completing and extending the C++ program that evaluates statements of an expression language contained in the module 3 case study. The statements of that expression language consist of an arithmetic expression f

CMSC 451 Project 1 Solved The first project involves benchmarking the behavior of Java implementations of one of the following sorting algorithms bubble sort selection sort insertion sort Shell sort, merge sort quick sort or heap sortCMSC 451 Project 1The first project involves benchmarking the behavior of Java implementations of one of thefollowing sorting algorithms, bubble sort, selection sort, insertion sort, Shell sort, merge sort,quick sort or heap sort. You must post your

The ready solutions purchased from Library are already used solutions. Please do not submit them directly as it may lead to plagiarism. Once paid, the solution file download link will be sent to your provided email. Please either use them for learning purpose or re-write them in your own language. In case if you haven't get the email, do let us know via chat support.

Get Free Quote!

268 Experts Online