0% found this document useful (0 votes)
12 views12 pages

Machine Learning Algorithms Implementation

The document outlines the implementation of various machine learning algorithms including Naïve Bayes, Decision Tree, Random Forest, Support Vector Machine, K-Nearest Neighbors, and K-means clustering. Each section includes steps for importing necessary libraries, creating and visualizing datasets, splitting data into training and testing sets, implementing the classifier, and making predictions. The code snippets provided demonstrate how to execute these algorithms using Python's scikit-learn library.

Uploaded by

Yash Jain
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
12 views12 pages

Machine Learning Algorithms Implementation

The document outlines the implementation of various machine learning algorithms including Naïve Bayes, Decision Tree, Random Forest, Support Vector Machine, K-Nearest Neighbors, and K-means clustering. Each section includes steps for importing necessary libraries, creating and visualizing datasets, splitting data into training and testing sets, implementing the classifier, and making predictions. The code snippets provided demonstrate how to execute these algorithms using Python's scikit-learn library.

Uploaded by

Yash Jain
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

1.

Naïve Bayes Algorithm


(i) Import suitable modules
(ii) Create dataset
(iii) Visualize dataset
(iv) Splitting data into training and testing set
(v) KNN classifier implementation
(vi) Prediction for KNN classifier

ANS:-
# (i) Import suitable modules
import numpy as np
import pandas as pd
import [Link] as plt
from sklearn.model_selection import train_test_split
from [Link] import KNeighborsClassifier
from [Link] import make_classification
from [Link] import accuracy_score

# (ii) Create dataset


X, y = make_classification(
n_samples=200, # number of samples
n_features=2, # only 2 features for easy visualization
n_informative=2,
n_redundant=0,
n_clusters_per_class=1,
random_state=42
)

# (iii) Visualize dataset


[Link](X[:, 0], X[:, 1], c=y, cmap='coolwarm')
[Link]('Dataset Visualization')
[Link]('Feature 1')
[Link]('Feature 2')
[Link]()

# (iv) Splitting data into training and testing set


X_train, X_test, y_train, y_test = train_test_split(
X, y, test_size=0.3, random_state=42
)

# (v) KNN classifier implementation


knn = KNeighborsClassifier(n_neighbors=5) # K = 5
[Link](X_train, y_train)
# (vi) Prediction for KNN classifier
y_pred = [Link](X_test)

# Evaluate accuracy
accuracy = accuracy_score(y_test, y_pred)
print(f"Accuracy of KNN Classifier: {accuracy * 100:.2f}%")

2. Decision Tree Algorithm


(i) Import suitable modules
(ii) Create dataset
(iii) Visualize dataset
(iv) Splitting data into training and testing set
(v) Decision Tree classifier implementation
(vi) Prediction for Decision Tree classifier
Ans:-
# (i) Import suitable modules
import numpy as np
import pandas as pd
import [Link] as plt
from sklearn.model_selection import train_test_split
from [Link] import DecisionTreeClassifier, plot_tree
from [Link] import make_classification
from [Link] import accuracy_score

# (ii) Create dataset


# Creating a synthetic dataset
X, y = make_classification(n_samples=200, n_features=2,
n_informative=2,
n_redundant=0, n_clusters_per_class=1,
random_state=42)

# (iii) Visualize dataset


[Link](X[:, 0], X[:, 1], c=y, cmap='viridis')
[Link]("Sample Dataset")
[Link]("Feature 1")
[Link]("Feature 2")
[Link]()

# (iv) Splitting data into training and testing set


X_train, X_test, y_train, y_test = train_test_split(X, y,
test_size=0.3, random_state=42)

# (v) Decision Tree classifier implementation


dtree = DecisionTreeClassifier(random_state=42)
[Link](X_train, y_train)
# (vi) Prediction for Decision Tree classifier
y_pred = [Link](X_test)

3. Random Forest Algorithm


(i) Import suitable modules
(ii) Create dataset
(iii) Visualize dataset
(iv) Splitting data into training and testing set
(v) Random Forest classifier implementation
(vi) Prediction for Random Forest classifier
Ans:-
# (i) Import suitable modules
import numpy as np
import pandas as pd
import [Link] as plt
from sklearn.model_selection import train_test_split
from [Link] import RandomForestClassifier
from [Link] import make_classification
from [Link] import accuracy_score
# (ii) Create dataset
X, y = make_classification(n_samples=200, n_features=2,
n_informative=2,
n_redundant=0, n_clusters_per_class=1,
random_state=42)

# (iii) Visualize dataset


[Link](X[:, 0], X[:, 1], c=y, cmap='coolwarm')
[Link]("Sample Dataset")
[Link]("Feature 1")
[Link]("Feature 2")
[Link]()

# (iv) Splitting data into training and testing set


X_train, X_test, y_train, y_test = train_test_split(X, y,
test_size=0.3, random_state=42)

# (v) Random Forest classifier implementation


rf_classifier = RandomForestClassifier(n_estimators=100,
random_state=42) # Using 100 trees
rf_classifier.fit(X_train, y_train)

# (vi) Prediction for Random Forest classifier


y_pred = rf_classifier.predict(X_test)

4. Support Vector Machine Algorithm


(i) Import suitable modules
(ii) Create dataset
(iii) Visualize dataset
(iv) Splitting data into training and testing set
(v) Support Vector Machine classifier implementation
(vi) Prediction for Support Vector Machine classifier

Ans:-
# (i) Import suitable modules
import numpy as np
import pandas as pd
import [Link] as plt
from sklearn.model_selection import train_test_split
from [Link] import SVC
from [Link] import make_classification
from [Link] import accuracy_score

# (ii) Create dataset


X, y = make_classification(n_samples=200, n_features=2,
n_informative=2,
n_redundant=0, n_clusters_per_class=1,
random_state=42)

# (iii) Visualize dataset


[Link](X[:, 0], X[:, 1], c=y, cmap='coolwarm')
[Link]("Sample Dataset")
[Link]("Feature 1")
[Link]("Feature 2")
[Link]()

# (iv) Splitting data into training and testing set


X_train, X_test, y_train, y_test = train_test_split(X, y,
test_size=0.3, random_state=42)

# (v) Support Vector Machine classifier implementation


svm_classifier = SVC(kernel='linear') # Using linear kernel
svm_classifier.fit(X_train, y_train)

# (vi) Prediction for Support Vector Machine classifier


y_pred = svm_classifier.predict(X_test)
5. K-Nearest Neighbors Algorithm
(i) Import suitable modules
(ii) Create dataset
(iii) Visualize dataset
(iv) Splitting data into training and testing set
(v) K-Nearest Neighbors classifier implementation
(vi) Prediction for K-Nearest Neighbors classifier

Ans:-
# (i) Import suitable modules
import numpy as np
import pandas as pd
import [Link] as plt
from sklearn.model_selection import train_test_split
from [Link] import KNeighborsClassifier
from [Link] import make_classification
from [Link] import accuracy_score

# (ii) Create dataset


X, y = make_classification(n_samples=200, n_features=2,
n_informative=2,
n_redundant=0, n_clusters_per_class=1,
random_state=42)
# (iii) Visualize dataset
[Link](X[:, 0], X[:, 1], c=y, cmap='coolwarm')
[Link]("Sample Dataset")
[Link]("Feature 1")
[Link]("Feature 2")
[Link]()

# (iv) Splitting data into training and testing set


X_train, X_test, y_train, y_test = train_test_split(X, y,
test_size=0.3, random_state=42)

# (v) K-Nearest Neighbors classifier implementation


knn_classifier = KNeighborsClassifier(n_neighbors=5) # Using
k=5
knn_classifier.fit(X_train, y_train)

# (vi) Prediction for K-Nearest Neighbors classifier


y_pred = knn_classifier.predict(X_test)

6. Write python code to implement K-means clustering for given


steps :
(i) Import libraries
(ii) Prepare sample data
(iii) Choose no. of cluster (K)
(iv) Fit data to algorithm
(v) Get cluster center
(vi) Get labels

Ans:-
# (i) Import libraries
import numpy as np
import [Link] as plt
from [Link] import KMeans
from [Link] import make_blobs

# (ii) Prepare sample data


X, _ = make_blobs(n_samples=300, centers=4, cluster_std=0.60,
random_state=0)

# Visualize the sample data


[Link](X[:, 0], X[:, 1], s=50)
[Link]("Sample Data for K-Means Clustering")
[Link]("Feature 1")
[Link]("Feature 2")
[Link]()

# (iii) Choose number of clusters (K)


k=4

# (iv) Fit data to algorithm


kmeans = KMeans(n_clusters=k, random_state=0)
[Link](X)

# (v) Get cluster centers


centers = kmeans.cluster_centers_
print("Cluster Centers:\n", centers)

# (vi) Get labels


labels = kmeans.labels_
print("Cluster Labels for each point:\n", labels)

You might also like