Suppose that the data mining task is to cluster points (with (x, y) representing location) into three clusters, where the points
are A1(4, 8), A2(2, 4), A3(1, 7), B1(5, 4), B2(5, 7), B3(6, 6), C1(3, 7), C2(7, 8). The distance function is Euclidean distance. Suppose initially we assign A1, B1, and C1as the center of each cluster, respectively. Please use the k-means algorithmand show your R code.(a)the three cluster centers after the first round of execution. (b)the final points in the three clusters after the algorithm stops.
1 answer:
Answer:
Explanation:
K- is the working procedure:
It takes n no. of predefined cluster as input and data points.
It also randomly initiate n centers of the clusters.
In this case the initial centers are given.
Steps you can follow
Step 1. Find distance of each data points from each centers.
Step 2. Assign each data point to the cluster with whose center is nearest to this data point.
Step 3. After assigning all data points calculate center of the cluster by taking mean of data points in cluster.
repeat above steps until the center in previous iteration and next iteration become same.
A1(4,8), A2(2, 4), A3(1, 7), B1(5, 4), B2(5,7), B3(6, 6), C1(3, 7), C2(7,8)
Centers are X1=A1, X2=B1, X3=C1
A1 will be assigned to cluster1, B1 will be assigned to cluster2 ,C1 will be assigned to cluster3.
Go through the attachment for the solution.
You might be interested in
Answer:
Following are the code to this question:
#include<iostream>//declaring header file
using namespace std;
int main()//main method
{
int n= 6,j=0;//declaring integer variable
int X[n];//defining an array
for(j=0;j<=n;j++)//defining a loop for input value
cin>>X[j];//input value from the user
if(j==0) //defining if block that checks value at beginning
{
if(X[j]>=X[j+1])//defining if block to check to compare first and second value
{
cout<<"A peak is at array index "<<j<<" and the value is "<<X[j];//use print method to largest value with index number
}
}
else//defining else block
{
for(j=0;j<=n;j++)//defining for loop for compare other value
{
if(j==n-1) //use if block that checks next index
{
if(X[j]>=X[j-1])//use if block to compare value
cout<<"A peak is at array index "<<j<<" and the value is "<<X[j];//use print method to largest value with index number
}
else
{
if(X[j]>=X[j-1] && X[j]>=X[j+1])//comapre value
cout<<"A peak is at array index "<<j<<" and the value is "<<X[j];//use print method to largest value with index number
}
}
}
return 0;
}
Output:
please find the attached file.
Explanation:
In the given code, inside the main method two integer variable "n and j", is declared, in the next step, an array "x"is defined which input the value from the user end.
- In the next step, multiple if block is used, in the first if block it comapre the first and second value if it grater then it will print the value with its index number.
- In the next if block, it comapre is next value and if it grater then it will print the value with its index number.
