What is a Hierarchical Clustering?

In this section, we will consider the hierarchical clustering - one more clustering algorithm.

How does this algorithm work? We will consider the AGNES (Agglomerative Nesting clustering) algorithm. It can be called a bottom-up approach since, in the beginning, all the points are in separate clusters. Then, some clusters are joined based on linkages, until all the necessary number of clusters will be reached.

In Python, the Hierarchical clustering algorithm is implemented within the AgglomerativeClustering function from the sklearn.cluster library. Unlike in the two previous sections, to predict the labels there you need to use the .fit_predict method with data as a parameter. Let's rewrite the necessary actions step by step:

Create an AgglomerativeClustering model object with a necessary number of clusters (n_clusters) and parameters set (will be considered in the next chapters).
Fit the data and predict the labels using the .fit_predict() function passing data as the parameter.

Agglomerative Clustering has many parameters, among them are n_clusters (as in the previous sections), linkage, affinity, and so on... We will consider them in future chapters.

Tâche

Swipe to start coding

Given the 2-D dataset of points (training dataset). The scatter plot is shown below.

Plot

You need to perform a Hierarchical Clustering for this data. Follow the next steps:

Import AgglomerativeClustering function from sklearn.cluster.
Create AgglomerativeClustering object model with 3 clusters.
Apply .fit_predict() method to model with data as a parameter. Add the result as 'prediction' column to data.
Build a scatter plot of data with 'x' column on the x-axis, 'y' column on the y-axis, and each point colored with respect to the 'prediction' column.

Solution

Passez à un bureau pour une pratique réelleContinuez d'où vous êtes en utilisant l'une des options ci-dessous

Tout était clair ?

Merci pour vos commentaires !

Section 3. Chapitre 1

What is a Hierarchical Clustering?

In this section, we will consider the hierarchical clustering - one more clustering algorithm.

Create an AgglomerativeClustering model object with a necessary number of clusters (n_clusters) and parameters set (will be considered in the next chapters).
Fit the data and predict the labels using the .fit_predict() function passing data as the parameter.

Agglomerative Clustering has many parameters, among them are n_clusters (as in the previous sections), linkage, affinity, and so on... We will consider them in future chapters.

Tâche

Swipe to start coding

Given the 2-D dataset of points (training dataset). The scatter plot is shown below.

Plot

You need to perform a Hierarchical Clustering for this data. Follow the next steps:

Import AgglomerativeClustering function from sklearn.cluster.
Create AgglomerativeClustering object model with 3 clusters.
Apply .fit_predict() method to model with data as a parameter. Add the result as 'prediction' column to data.
Build a scatter plot of data with 'x' column on the x-axis, 'y' column on the y-axis, and each point colored with respect to the 'prediction' column.

Solution

Passez à un bureau pour une pratique réelleContinuez d'où vous êtes en utilisant l'une des options ci-dessous

Tout était clair ?

Merci pour vos commentaires !

Section 3. Chapitre 1

Passez à un bureau pour une pratique réelleContinuez d'où vous êtes en utilisant l'une des options ci-dessous