Clustering Algorithms in Python, unsupervised learning

Sergio Montes
Universidad Rey Juan Carlos

smontesleon@gmail.com

Ecuador

10/10/2019

Resumen
Se realiza un ejemplo de aprendiza je no supervisado, usando el algoritmo k-means, Suite

Anaconda Figura 1 y el IDE Spyder Figura 2.

1. Introducción

Replica de k-means usando python, fuente <https://towardsdatascience.com/an-introduction-to-clusterin

escrita por Jake Huneycutt de Towards Data Science

2. clusters aleatorios

2.1. Gráca de clusters

Código:

# import statements
from sklearn.datasets import make_blobs
import numpy as np
import matplotlib.pyplot as plt

# create blobs
data = make_blobs(n_samples=200, n_features=2, centers=4, cluster_std=1.6, random_state=50)

# create np array for data points

points = data[0]

# create scatter plot

plt.scatter(data[0][:,0], data[0][:,1], c=data[1], cmap='viridis')
plt.xlim(-15,15)
plt.ylim(-15,15)

Gráca Figura 3

2.2. Implementando K-means

Código:
# import KMeans
from sklearn.cluster import KMeans

# create kmeans object

kmeans = KMeans(n_clusters=4)

1
Figura 1: Suite Anaconda.

Figura 2: IDE Spyder.

2
 Figura 3: Blobs.

Figura 4: K-means.

# fit kmeans object to data

kmeans.fit(points)
# print location of clusters learned by kmeans object
print(kmeans.cluster_centers_)
# save new clusters for chart
y_km = kmeans.fit_predict(points)

plt.scatter(points[y_km ==0,0], points[y_km == 0,1], s=100, c='red')

plt.scatter(points[y_km ==1,0], points[y_km == 1,1], s=100, c='black')
plt.scatter(points[y_km ==2,0], points[y_km == 2,1], s=100, c='blue')
plt.scatter(points[y_km ==3,0], points[y_km == 3,1], s=100, c='cyan')

Gráca Figura 6

2.3. Hierarchical Clustering

Código:
# import hierarchical clustering libraries
import scipy.cluster.hierarchy as sch

3
 Figura 5: Hierarchical Cluster.

from sklearn.cluster import AgglomerativeClustering

# create dendrogram
dendrogram = sch.dendrogram(sch.linkage(points, method='ward'))
# create clusters
hc = AgglomerativeClustering(n_clusters=4, affinity = 'euclidean', linkage = 'ward')
# save clusters for chart
y_hc = hc.fit_predict(points)

plt.scatter(points[y_hc ==0,0], points[y_hc == 0,1], s=100, c='red')

plt.scatter(points[y_hc==1,0], points[y_hc == 1,1], s=100, c='black')
plt.scatter(points[y_hc ==2,0], points[y_hc == 2,1], s=100, c='blue')
plt.scatter(points[y_hc ==3,0], points[y_hc == 3,1], s=100, c='cyan')

Gráca Figura 5
Gráca Figura 6

2.4. Concluciones
Se ha lograda una práctica del aprendizaje no supervisado y visualización de cluster usando
k-means y hierarchical, usando python 3.

4
Figura 6: K-means.