0 ratings0% found this document useful (0 votes) 53 views3 pagesML Short Notes
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content,
claim it here.
Available Formats
Download as PDF or read online on Scribd
IMPORTANT
MACHINE
LEARNING
ALGORITHMS
* Linear
=> Tr fs used t© predier veal values. A yelatfonship is
established between independent and dependent variables by
Fitting a besh Fit Jine. This best Fit rine ts KnoWn as
yegyesston line and vepresented aS Yq X+b
a- Slope
b- finfeveepr
Y- Dependent yasiopte
X~- Independent variable
K Logistic Regression
& Tr is a classification algorithm used to exHmare discvere
volues ( udlues tke 0/1, yes/no) based on given set oF
independent variables. Ite output value lies between 6 andl.
Uses the Sigmotd function «
‘nove? GALLERY TreLeuAAATy
* K=means
=> Tr isa type of uncupervised algorithm whieh solves the
clusteving pvobjem. Its Procedure Po1jows a Simple Woy to
classify a given data set into ceyraln numbers OF Clusters
(ik clusters)HK KNN (K Nearest Neighbours
=> K Neavect Neighbors js a Simple algoxithm that stoves all
available cases and classthes new cases by 4 Majority vote
of Its K neighbo¥s- The case being assigned to the clace Is
Most common amongst Its kK nearest nelghbors measured
by a distance function.
NOTES CALLERY (TELEGRAM ) -
=> Tr }sa supervised learning algorithm used for classification
Problems which works fox both categorical and continuous
dependent variables. In +his algovithm , the population js eplit
Jaro 90 oF more homogenous «puts. If used different
Techniques like Cini Impurity {Information Gain, chi - Sqpave
entvopy
* _Svm ( Suppost Veuroy Machine)
=> Th this algorithm, each dara item Is plotted as @ point in a
Nn = Aimenstonal space (N-number of Features) With the
Value of each Featuye being the value ofa pavtiewar
(O- Ordinate. A classifier line js then found berdeen the
features. Depending on Where tne testing dara tands ,
the dara js clascfied accordingly -
HK PLandom foresk
=> Fb collettlon of detision qrees 1s called a¢ Random forest -
TO classify a new objeur based on Its attyibures, each
tree js classified and the tree vores For thar clase. The
forest chooses the classification hoving the most votes=D Tt Ys @ supewtsed Jeayning algorithm Which 13 based on Bayes
theorem and used for solulng classification pyopiems- Bayes
theorem }s Used fo detevmne the Probobility of 9 hypothesis
with prioy Knowledge »
P(a)B) = PCBJA) P(A)
mon (LINKEDInL)-
NOTES GALLERY (TELEGRAM),
HK Gyxadient Boosting Aygovithm
=> We main tdea behind the Algorithm fs to bulld models
Sequentiatly and these Subcequent models Try +o yeduce
tne exvors OF the previous models . Then +nese models are
Combined +o Improve the accuvacy score.