Reference no: EM13165453
Programs must be running, and would be demonstrated to the instructor. There is 30% weight for writing a detailed high level algorithm and 70% weight for the running code. No credit for not running code even if you have correct algorithm. All material should be neatly typed on the computer. There is a 20% bonus points for neatness of presentation.
Problem # 1. Write a K-means high level algorithm and program for clustering the N-dimensional data point in your own language. The algorithm should be able to read the data from a data file that has data in the following form. Note: you can use software library for sorting if needed.
Dimensions = <integer>
<Tuple 1> <disease>
<tuple 2> <disease>
....
<tuple N> <disease>
<Tuple> will be given as comma separated dimension coordinates starting from dimension 1. The dimension value will be given from 1..100. The <disease> will be a word for example 'diabetes', 'kidney problem', 'acidity' etc. If the <disease> column is missing, it would mean no disease is associated with that value.
The distance measure will be Euclidean that means it is square root of squares of difference of coordinate and centeroids. Your program should display the coordinates of the centroid on the screen, the threshold value you gave, and the maximum distance from the centroid to the farthest point in a cluster for all the clusters. It should also give the coordinates of the 'Outliers' in a separate output file. Outliers are those points that do not belong to any cluster.
Problem #2. Write a minimum spanning tree high level algorithm and program for clustering the N-dimensional data point in your own language. The algorithm should be able to read the data from a data file that has data in the following form. Note: Greedy algorithms are good for MST. You can use software library for sorting if needed.
Dimensions = <integer>
<Tuple 1> <disease>
<tuple 2> <disease>
....
<tuple N> <disease>
<Tuple> will be given as comma separated dimension coordinates starting from dimension 1. The dimension value will be given from 1..100. The <disease> will be a word for example 'diabetes', 'kidney problem', 'acidity' etc. If the <disease> column is missing, it would mean no disease is associated with that value.
The distance measure will be Euclidean that means it is square root of squares of difference of coordinate and centeroids. Your program should display the coordinates of the centroid on the screen, the threshold value you gave, and the maximum distance from the centroid to the farthest point in a cluster for all the clusters. It should also give the coordinates of the 'Outliers' in a separate output file. Outliers are those points that do not belong to any cluster.
Once the user enters a 0
: Once the user enters a 0 you will exit the loop, close the file and execute the code as previously designed until you have displayed all of the scores and the average handicap.
|
Determine the number of whole units
: Determine the number of whole units to be accounted for and to be assigned costs and the equivalent units of production for the Drawing Department.
|
Create a class account that represents a banking account.
: Create a class Account that represents a banking account.
|
Find the number of automobiles
: The mass of an average blueberry is 0.72 g and the mass of an automobile is 1900 kg. Find the number of automobiles whose total mass is the same as 1.0 {rm mol} blueberries.
|
Give the coordinates of the ''outliers''
: The threshold value you gave, and the maximum distance from the centroid to the farthest point in a cluster for all the clusters. It should also give the coordinates of the 'Outliers' in a separate output file. Outliers are those points that do no..
|
Analyze the purity of aspirin
: although aspirin solutions do not absorb visible light, we are still able to use visible light in an experiment to analyze the purity of aspirin. Why?
|
Prepare a common-size income statement and balance sheet
: Prepare a common-size income statement and balance sheet for McDonough Products. The first column of each statement should present McDonough Products common-size statement, and the second column should show the industry averages.
|
What is the total password population
: A phonetic password generator picks two segments randomly for each six-letter password. the form of each segment is consonant, voul, consonant, where V= and C= (V)
|
How many grams mtbe must be present in each gasoline
: If fuel mixtures are required to contain 3.0 oxygen by mass, how many grams MTBE must be present in each 110 gasoline.
|