K Means cluster , Decision tree , SVM

K Means cluster

This a unsupervised machine learning algorithm. It form data into K clusters. Cluster are formed by choosing centroid. At first random centroid is picked. Iterating the process until centroid changes no more.

Decision Tree

In this algorithm flowchart of decision is formed on basis of that prediction is done. Every feature chosen as such it decreases entropy.


How different our data is or how variation present in our data is called entropy.

SVM – Support Vector Machine

When number of features are more then SVM is a good choice. It creates hyperplanes which separate various cluster of data. It is supervised learning algorithm. It works on kernel. Different kernels can be used as convenience.

Ensemble learning

It is simple combine two or more models results together. For example – Random Forest – Decision trees are bagged here, means result from various Decision tree is averaged.


Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s