A Review on mobile SMS Spam filtering techniques

Under short messaging service (SMS) spam is understood the unsolicited or undesired messages received on mobile phones. These SMS spams constitute a veritable nuisance to the mobile subscribers. This marketing practice also worries service providers in view of the fact that it upsets their clients or even causes them lose subscribers. By way of mitigating this practice, researchers have proposed several solutions for the detection and filtering of SMS spams. In this paper, we present a review of the currently available methods, challenges, and future research directions on spam detection techniques, filtering, and mitigation of mobile SMS spams. The existing research literature is critically reviewed and analyzed. The most popular techniques for SMS spam detection, filtering, and mitigation are compared, including the used data sets, their findings, and limitations, and the future research directions are discussed. This review is designed to assist expert researchers to identify open areas that need further improvement

Analisis dan Implementasi Algoritma Graph-basedK-Nearest Neighbour untuk Klasifikasi Spam pada Pesan Singkat

Pesan singkat atau Short Message Service (SMS) adalah salah satu layanan komunikasi yang sangat populer pada mobile phone saat ini karena kemudahan penggunaan, sederhana, cepat, dan murah. Meningkatnya penggunaan mobile phone ini dimanfaatkan oleh banyak pihak untuk mendapatkan keuntungan, salah satunya adalah mengirimkan spam melalui SMS. Spam biasanya berisikan iklan dari suatu produk, promosi, atau malware yang sangat mengganggu pengguna mobile phone. Oleh sebab itu, dalam tugas akhir ini dibuatlah SMS spam filter untuk menyaring SMS yang menggunakan algoritma Graph-based K-Nearest Neighbour (GKNN). SMS yang didapatkan terlebih dahulu di preprocessing kemudian data akan direpresentasikan ke dalam model graf berbobot dan berarah. Pengujian algoritma dilakukan dengan menggunakan skenario pembagian data 5-fold dan 10-fold dan didapatkan hasil dengan rata-rata akurasi mencapai 99,06% untuk 5-fold dan 99,13% untuk 10-fold. Kata Kunci : spam, spam filtering, preprocessing, klasifikasi, k-nearest neighbour, graph-based k-nearest neighbou

Graph-based learning model for detection of SMS spam on smart phones

Short Message Service (SMS) has been increasingly exploited through spam propagation schemes in recent years. This paper presents a new method for graph-based learning and classification of spam SMS on mobile devices and smart phones. Our approach is based on modeling the content and patterns of SMS syntax into a direct ed-weighted graph through exploiting modern composition style of messages. The graph attributes are then used to classify spam messages in real-time by using KL-Divergence measure. Experimental results on two real-world datasets show that our proposed method achieves high detection accuracy with less false alarm rate to detect spam messages. Moreover, our approach requires relatively less memory and processing power, making it suitable to deploy on resource-constrained mobile devices and smart phones.status: publishe