Chinninti Venkata Assessment Machine Learning
Chinninti Venkata Assessment Machine Learning
ASSIGNMENT ON DESIGN
Step 2. Algorithm
Step 1.
The Iris Dataset depends on many factors which need to be clustered precisely
using different available machine learning algorithms.
On the other hand, we have k-means Clustering as well to divide the data into
clusters using centroids, but I choose hierarchical clustering as of the we know
that it has 3 types of classes in the given data.
For this data hierarchical clustering, be well suited and can classify the data into
the respected clusters by the similarities in between the dataset.
The decision of merging the clusters can be calculated by the closeness of the
clusters. We use the Euclidean distance matric.
Next, we select the linkage for computing the distance matric. There are many
linkages single, complete, ward, centroid etc.
Flowchart of Hierarchical Clustering Algorithm [2]
Here, we have seted each data point as a Cluster from the Computation Matrix
for the considered Inputs.
Hence ,not equals to one ,we need to merge the closet cluster hence after need
to update the Matrix.
Algorithm:
Step1: Start.
Step2: Enter the data input features.
Step3: Compute the distance matrix.
Step4: Set each point as a cluster.
Step5: iterate foe n=1 cluster if data is clustered end otherwise next step
[1] https://www.geeksforgeeks.org/difference-between-k-means-and-
hierarchical-clustering/
[2] https://www.researchgate.net/figure/Flowchart-of-the-Hierarchical-
Clustering_fig7_232402905