.

ISSN 2063-5346
For urgent queries please contact : +918130348310

ANALYSIS OF DECISION TREE CLASSIFIER, NOVEL TREE SPECIFIC RANDOM FOREST CLASSIFIER, SUPPORT VECTOR MACHINE ALGORITHM WITH K-NEAREST NEIGHBOR FOR DETECTING SPAM SMS.

Main Article Content

N. Srinivasulu, R. Sabitha
» doi: 10.31838/ecb/2023.12.sa1.414

Abstract

Aim: The proposed study aims to detect Spam SMS using the Decision Tree Classifier, Novel Tree Specific Random Forest Classifier, Support Vector Machine Algorithm in comparison with K-Nearest Neighbor. Materials and Methods: The dataset considered in the current research is available on Kaggle, a machine learning repository. The dataset SMS spam collection dataset contains 5572 instances and two attributes v1 and v2. The v2 is the input messages which are either spam or nonspam. The predicted label v1 has two classes: 0 = nonspam and 1 spam. In the data, 4900 are non spam samples and 672 are spam samples. The sample size was calculated using G Power(95%). The accuracy and sensitivity of the classification of SMS spam detection were evaluated and recorded. Results: The accuracy was maximum in the classification of SMS spam detection using Decision Tree Classifier(95%), Novel Tree Specific Random Forest Classifier(97.3%), Support Vector Machine(98%) Algorithm with a minimum mean error when compared with K-Nearest Neighbor (93%). There is a significant difference of 0.010 between the classifiers which infers the groups are significant. Conclusion: The study proves that the Decision Tree Classifier Algorithm exhibits better accuracy than the KNearest Neighbor in Classification of SMS spam detection.

Article Details

SCImago Journal & Country Rank