(Un/Semi-)supervised SMS text message SPAM detection. (August 2015)

• Record Type: Journal Article
• Authors: GIANNELLA, CHRIS R.; WINDER, RANSOM; WILSON, BRANDON
• Is Part Of: Natural language engineering. Volume 21:Part 4(2015)
• Page Start: 553
• Page End: 567
• Publication Date: 2015-08
• Subjects: Natural language processing (Computer science) -- Periodicals; Software engineering -- Periodicals; 006.35
• DOI: 10.1017/S1351324914000102
• Languages: English
• ISSNs: 1351-3249

Abstract

<abstract abstract-type="normal"> <title>Abstract</title> <p>We address the problem of unsupervised and semi-supervised SMS (Short Message Service) text message SPAM detection. We develop a content-based Bayesian classification approach which is a modest extension of the technique discussed by Resnik and Hardisty in 2010. The approach assumes that the bodies of the SMS messages arise from a probabilistic generative model and estimates the model parameters by Gibbs sampling using an unlabeled, or partially labeled, SMS training message corpus. The approach classifies new SMS messages as SPAM or HAM (non-SPAM) by zero-thresholding their logit estimates. We tested the approach on a publicly available SMS corpora collected from the UK. Used in semi-supervised fashion, the approach clearly outperformed a competing algorithm, Semi-Boost. Used in unsupervised fashion, the approach outperformed a fully supervised classifier, an SVM (Support Vector Machine), when the number of training messages used by the SVM was small and performed comparably otherwise. We believe the approach works well and is a useful tool for SMS SPAM detection.</p> </abstract>