学ぶ Cluster Centers | K-Medoids Algorithm

セクション 2. 章 2

single

メニューを表示するにはスワイプしてください

In the previous chapter, we compared the K-Means and K-Medoids algorithms. It was mentioned that, unlike K-Means, the K-Medoids algorithm has data points as medoids. Let's visualize the differences.

For example, for the training dataset with three clusters we can visualize the clusters and their centers for both K-Means and K-Medoids. The results are displayed below.

If you watch closely to the right chart and compare it with the central one, you will notice that marked points are data points, unlike the points on the left chart. I've marked these points with green arrows. Let's represent the difference using a more obvious example! The result of clustering using the K-Means algorithm, and cluster centers (labeled with 10) are displayed below.

タスク

スワイプしてコーディングを開始

For the same dataset of points data compute the K-Medoids algorithm, and display the cluster centers. Follow the next steps:

Import KMedoids function from sklearn_extra.cluster library.
Create KMedoids model model with 2 clusters.
Fit the data to the model.
Add 'prediction' column with predicted by model labels to data.
Use the .cluster_centers_ method to extract the clusters centers array.
Visualize the clusters (already done) and centers. Within the second .scatterplot function set hue to 10, and s to 150.

解答

実践的な練習のためにデスクトップに切り替える下記のオプションのいずれかを利用して、現在の場所から続行する

すべて明確でしたか？

フィードバックありがとうございます！

セクション 2. 章 2

single

AIに質問する

何でも質問するか、提案された質問の1つを試してチャットを始めてください