Kursinhalt
Cluster Analysis in Python
Cluster Analysis in Python
K-Medoids and the Weather Data
As you can see, there was no such clear peek as in the example. That means that both 3 and 4 clusters may be a good choice!
Let's see what will be the result of using the K-Medoids algorithm for the weather data we used in the previous section. Let's start with defining the optimal number of clusters.
Swipe to start coding
Given cities' average temperatures dataset data
. The numerical columns are 3 - 14.
Your tasks are:
- Using
for
loop iterate overn_cl
. Within the loop:
- Create
KMedoids
model withj
clusters namedmodel
. - Fit the 2-15 columns of
data
to the model. Watch out that indices in Python start from 0. - Add silhouette score value to the
silhouettes
list. Remember to pass two parameters: the data used for fitting (the same 3-15 columns) and predicted bymodel
labels.
- Visualize the results using
lineplot
ofsns
. Passn_cl
asx
parameter andsilhouettes
asy
. Do not forget to apply the.show()
method to display the plot.
Lösung
Danke für Ihr Feedback!
K-Medoids and the Weather Data
As you can see, there was no such clear peek as in the example. That means that both 3 and 4 clusters may be a good choice!
Let's see what will be the result of using the K-Medoids algorithm for the weather data we used in the previous section. Let's start with defining the optimal number of clusters.
Swipe to start coding
Given cities' average temperatures dataset data
. The numerical columns are 3 - 14.
Your tasks are:
- Using
for
loop iterate overn_cl
. Within the loop:
- Create
KMedoids
model withj
clusters namedmodel
. - Fit the 2-15 columns of
data
to the model. Watch out that indices in Python start from 0. - Add silhouette score value to the
silhouettes
list. Remember to pass two parameters: the data used for fitting (the same 3-15 columns) and predicted bymodel
labels.
- Visualize the results using
lineplot
ofsns
. Passn_cl
asx
parameter andsilhouettes
asy
. Do not forget to apply the.show()
method to display the plot.
Lösung
Danke für Ihr Feedback!