Assignment 1
Assignment 1
shubham funday
August 2022
1 Naive Bayes
Naive Bayes algorithm works on Bayes theorem and takes a probabilistic ap-
proach, unlike other classification algorithms. The algorithm has a set of prior
probabilities for each class. Once data is fed, the algorithm updates these prob-
abilities to form something known as posterior probability. This comes useful
when you need to predict whether the input belongs to a given list of classes or
not.
2 Decision Tree
The decision tree algorithm is more of a flowchart like an algorithm where nodes
represent the test on an input attribute and branches represent the outcome of
the test.
3 Random Forest
Random forest works like a group of trees. The input data set is subdivided
and fed into different decision trees. The average of outputs from all decision
trees is considered. Random forests offer a more accurate classifier as compared
to Decision tree algorithm.
5 K Nearest Neighbours
KNN algorithm uses a bunch of data points segregated into classes to predict
the class of a new sample data point. It is called “lazy learning algorithm” as
it is relatively short as compared to other algorithms.
1
6 Linear regression
a) It is used to measure genuine qualities by considering the consistent variables.
It is the simplest of all regression algorithms but can be implemented only in
cases of linear relationship or a linearly separable problem. The algorithm draws
a straight line between data points called the best-fit line or regression line and
is used to predict new values
7 Multivariate Regression
This algorithm has to be used when there is more than one predictor variable.
This algorithm is extensively used in retail sector product recommendation en-
gines, where customers preferred products will depend on multiple factors like
brand, quality, price, review etc.