Scribd
Upload
7 views

Program 7

The document demonstrates implementing and comparing K-means clustering and expectation maximization (EM) clustering algorithms. Random sample data is generated and clustered using both algorithms, then the results are compared and visualized.

Uploaded by

maddymoody886
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
7 views

Program 7

The document demonstrates implementing and comparing K-means clustering and expectation maximization (EM) clustering algorithms. Random sample data is generated and clustered using both algorithms, then the results are compared and visualized.

Uploaded by

maddymoody886
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Aim: Implement and demonstrate the working model of K-means clustering algorithm with

Expectation Maximization Concept.

Program: Apply EM algorithm to cluster a set of data stored in a .CSV file. Use the same data set for
clustering using k-Means algorithm. Compare the results of these two algorithms and comment on
the quality of clustering. You can add Python ML library classes/API in the program.

import numpy as np

import pandas as pd

# Generate random data for testing

np.random.seed(0) # for reproducibility

num_samples = 100

num_features = 2

# Generate random data points

data = np.random.rand(num_samples, num_features)

# Convert to DataFrame

df = pd.DataFrame(data, columns=['X', 'Y'])

# Save DataFrame to CSV file

df.to_csv('test_data.csv', index=False)

print("CSV file 'test_data.csv' has been generated successfully.")


import numpy as np

import pandas as pd

from sklearn.cluster import KMeans

from sklearn.mixture import GaussianMixture

import matplotlib.pyplot as plt

# Load the dataset from CSV file

data = pd.read_csv('test_data.csv')

# Visualize the dataset if needed

# plt.scatter(data['X'], data['Y'])

# plt.xlabel('X')

# plt.ylabel('Y')

# plt.show()

# Convert the dataset to numpy array

X = data.values

# Number of clusters

k=3

# K-means clustering

kmeans = KMeans(n_clusters=k)

kmeans.fit(X)

kmeans_labels = kmeans.labels_

kmeans_centers = kmeans.cluster_centers_

# EM clustering

em = GaussianMixture(n_components=k)

em.fit(X)

em_labels = em.predict(X)
em_centers = em.means_

# Compare clustering results

print("K-means labels:")

print(kmeans_labels)

print("EM labels:")

print(em_labels)

# Visualize clustering results

plt.figure(figsize=(12, 5))

plt.subplot(1, 2, 1)

plt.scatter(X[:, 0], X[:, 1], c=kmeans_labels, cmap='viridis')

plt.scatter(kmeans_centers[:, 0], kmeans_centers[:, 1], marker='*', s=300, c='r')

plt.title('K-means Clustering')

plt.subplot(1, 2, 2)

plt.scatter(X[:, 0], X[:, 1], c=em_labels, cmap='viridis')

plt.scatter(em_centers[:, 0], em_centers[:, 1], marker='*', s=300, c='r')

plt.title('EM Clustering')

You might also like