Spam Detection
Spam Detection
Therefore, P (S |Spam) = P ('You' |Spam) P ('have' |Spam) P ('won' |Spam) P ('a '|Spam) P ('lottery' |Spam)
__ 2
Same calculation for P (S |Not Spam)
If 2 > 3, then 'Spam' Else, 'Not_ Spam'.
2)Support Vector Machines
Support Vector Machine is the most sought-after algorithm for classic classification problems. SVMs work
on the algorithm of Maximal Margin, i.e., to find the maximum margin or threshold between the support
vectors of the two classes (in binary classification). The most effective Support vector machines are the
soft maximal margin classifier, that allows one misclassification, the model starts with low bias (slightly
poor performance) to ensure low variance later.
3)Random Forests (Bagging)
Random forest has nearly the same hyperparameters as a decision tree or a bagging classifier. Ensemble
methods turn any feeble model into a highly powerful.
III. MODELING AND ANALYSIS
Model and Material which are used is presented in this section.