Bike Buyer Prediction Using Classification Algorithm
Bike Buyer Prediction Using Classification Algorithm
Classification Algorithm
Machine learning
K-Nearest neighbors
Support Vector Machines
Decision Tree Classification
Random Forest Classification
KNN (K- Nearest Neighbors)
It’s a simple algorithm that stores all available cases and
classifies any new cases by taking a majority vote of its
k neighbours. The case is then assigned to the class with
which it has the most in common.
Things to consider before selecting KNN:
1:KNN is computationally expensive
2:Variables should be normalized, or else higher
range variables can bias the algorithm
3:Data still needs to be pre-processed
SVM (Support Vector Machine)
SVM is a method of classification in which you plot raw
data as points in an n-dimensional space (where n is the
number of features you have).
The value of each feature is then tied to a particular
coordinate, making it easy to classify the data. Lines
called classifiers can be used to split the data and plot
them on a graph.
Decision Tree
One of the most popular machine learning algorithms in
use today, this is a supervised learning algorithm that is
used for classifying problems.
It works well classifying for both categorical and
continuous dependent variables. In this algorithm, we split
the population into two or more homogeneous sets based
on the most significant attributes/ independent variables
Random Forest
A collective of decision trees is called a Random Forest. To
classify a new object based on its attributes, each tree is
classified, and the tree “votes” for that class. The forest
chooses the classification having the most votes
Each tree is planted & grown as follows:
If the number of cases in the training set is N, then a sample
of N cases is taken at random. This sample will be the
training set for growing the tree.
If there are M input variables, a number m<<="" li=""
style="box-sizing: border-box;">
Each tree is grown to the largest extent possible. There is no
pruning.
BENEFITS