{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T17:42:00Z","timestamp":1784223720293,"version":"3.55.0"},"reference-count":95,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/access.2024.3364671","type":"journal-article","created":{"date-parts":[[2024,2,9]],"date-time":"2024-02-09T18:36:53Z","timestamp":1707503813000},"page":"24306-24324","source":"Crossref","is-referenced-by-count":59,"title":["Investigating Evasive Techniques in SMS Spam Filtering: A Comparative Analysis of Machine Learning Models"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0722-1917","authenticated-orcid":false,"given":"Muhammad","family":"Salman","sequence":"first","affiliation":[{"name":"School of Computing, Macquarie University, Sydney, NSW, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2113-3390","authenticated-orcid":false,"given":"Muhammad","family":"Ikram","sequence":"additional","affiliation":[{"name":"School of Computing, Macquarie University, Sydney, NSW, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2714-0276","authenticated-orcid":false,"given":"Mohamed Ali","family":"Kaafar","sequence":"additional","affiliation":[{"name":"School of Computing, Macquarie University, Sydney, NSW, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","first-page":"39","article-title":"Investigating and prosecuting Nigerian fraud","volume":"49","author":"Buchanan","year":"2001","journal-title":"U.S. Att\u2019ys Bull."},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1039621.1039625"},{"key":"ref3","article-title":"On attacking statistical spam filters","volume-title":"Proc. CEAS","author":"Wittel"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2034691.2034742"},{"issue":"1","key":"ref5","first-page":"1","article-title":"Towards SMS spam filtering: Results under a new dataset","volume":"2","author":"Almeida","year":"2013","journal-title":"JiSS"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/IC3.2018.8530469"},{"key":"ref7","article-title":"Using BERT encoding to tackle the mad-lib attack in SMS spam detection","author":"Rojas-Galeano","year":"2021","journal-title":"arXiv:2107.06400"},{"key":"ref8","volume-title":"The Top Text Scams of 2022","year":"2022"},{"key":"ref9","volume-title":"Accs Scam Statistics","year":"2022"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-022-12991-0"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2014.08.054"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3538491"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/IWSSIP55020.2022.9854496"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3559351"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.radonc.2011.12.006"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.3390\/app10145011"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ETCS.2009.299"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2666785"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2516760.2516772"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2015.05.067"},{"key":"ref21","article-title":"TextBugger: Generating adversarial text against real-world applications","author":"Li","year":"2018","journal-title":"arXiv:1812.05271"},{"key":"ref22","article-title":"Towards a robust deep neural network in texts: A survey","author":"Wang","year":"2019","journal-title":"arXiv:1902.07285"},{"key":"ref23","article-title":"Adversarial attacks and defense on texts: A survey","author":"Huq","year":"2020","journal-title":"arXiv:2005.14108"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/SPW.2018.00016"},{"key":"ref25","volume-title":"Action Fraud","year":"2023"},{"key":"ref26","volume-title":"UCI Machine Learning Repository\u2014SMS Spam Collection Data Set","year":"2012"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-demos.16"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.3390\/fi11040089"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.17487\/rfc3492"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1166160.1166191"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s10579-012-9197-9"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.3390\/s23083861"},{"key":"ref33","article-title":"A comparison of generative and discriminative classifiers in SMS spam classification","volume-title":"Proc. ICTEC","author":"Ariff"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1186\/s40537-023-00720-9"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-27524-1_57"},{"key":"ref36","first-page":"3924","article-title":"Singlish message paraphrasing: A joint task of creole translation and text normalization","volume-title":"Proc. 29th Int. Conf. Comput. Linguistics","author":"Liu"},{"key":"ref37","first-page":"5243","article-title":"Singlish where got rules one? Constructing a computational grammar for Singlish","volume-title":"Proc. 13th Lang. Resour. Eval. Conf.","author":"Chow"},{"key":"ref38","first-page":"1286","article-title":"A unifying view on task-oriented dialogue annotation","volume-title":"Proc. LREC","author":"Hude\u010dek"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-19-5443-6_4"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3600160.3600163"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ICCSNT.2011.6181918"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2019.09.001"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s41870-018-0157-5"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.3390\/robotics8030050"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/COLCOM.2005.1651219"},{"key":"ref46","volume-title":"How to Beat a Bayesian Spam Filter","author":"Graham-Cumming","year":"2004"},{"key":"ref47","article-title":"Blacklight: Scalable defense for neural networks against query-based black-box attacks","author":"Li","year":"2020","journal-title":"arXiv:2006.14042"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.17487\/rfc3490"},{"key":"ref49","volume-title":"Langdetect","author":"Danilk","year":"2023"},{"key":"ref50","volume-title":"Google Language Detection API","year":"2023"},{"issue":"159","key":"ref51","first-page":"2","article-title":"Tesseract: An open-source optical character recognition engine","volume":"2007","author":"Kay","year":"2007","journal-title":"Linux J."},{"key":"ref52","volume-title":"GitHub\u2014Sanshbansal\/Spam Detection Analytics Tool","author":"Bansal","year":"2023"},{"key":"ref53","volume-title":"SMS Spam Prediction","author":"Hasan","year":"2023"},{"key":"ref54","article-title":"Machine learning for e-mail spam filtering: Review, techniques and trends","author":"Bhowmick","year":"2016","journal-title":"arXiv:1606.01042"},{"key":"ref55","volume-title":"Pyspellchecker","year":"2023"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.3390\/info11090430"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/2030376.2030387"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.3115\/1118108.1118117"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1201.0490"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-010-0001-0"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37798-3_1"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1145\/2348283.2348453"},{"key":"ref63","article-title":"Efficient estimation of word representations in vector space","author":"Mikolov","year":"2013","journal-title":"arXiv:1301.3781"},{"key":"ref64","article-title":"Exploiting similarities among languages for machine translation","author":"Mikolov","year":"2013","journal-title":"arXiv:1309.4168"},{"key":"ref65","volume-title":"Gensim\u2014Statistical Semantics in Python","author":"Rehurek","year":"2011"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1162"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1162\/tacl_a_00051"},{"key":"ref68","article-title":"BERT: Pre-training of deep bidirectional transformers for language understanding","author":"Devlin","year":"2018","journal-title":"arXiv:1810.04805"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N18-1202"},{"key":"ref70","volume-title":"Statistical Learning Theory","author":"Vapnick","year":"1998"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.5555\/944790.944808"},{"key":"ref72","article-title":"Learning from positive and unlabeled data with adversarial training","volume-title":"Proc. ICLR","author":"Hu"},{"key":"ref73","first-page":"1","article-title":"Spam detection using clustering, random forests, and active learning","volume-title":"Proc. EAA","author":"DeBarr"},{"key":"ref74","article-title":"Bag of tricks for efficient text classification","author":"Joulin","year":"2016","journal-title":"arXiv:1607.01759"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1002\/047084535X"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2019.8852406"},{"key":"ref77","article-title":"An empirical evaluation of generic convolutional and recurrent networks for sequence modeling","author":"Bai","year":"2018","journal-title":"arXiv:1803.01271"},{"key":"ref78","article-title":"Convolutional neural network for sentence classification","author":"Chen","year":"2015"},{"key":"ref79","article-title":"DistilBERT, a distilled version of BERT: Smaller, faster, cheaper and lighter","author":"Sanh","year":"2019","journal-title":"arXiv:1910.01108"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1907.11692"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1145\/503124.503156"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-16-6636-0_51"},{"key":"ref83","volume-title":"Punycode Generator","year":"2023"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2016.12.035"},{"key":"ref85","first-page":"3971","article-title":"Dos and don\u2019ts of machine learning in computer security","volume-title":"Proc. 31st USENIX Secur. Symp. (USENIX Security)","author":"Arp"},{"key":"ref86","volume-title":"Fasttext\u2014faster, Better Text Classification!","year":"2016"},{"key":"ref87","volume-title":"Selendroid: Selenium for Android","year":"2023"},{"key":"ref88","volume-title":"OOPSpamAnti-Spam API","year":"2023"},{"key":"ref89","volume-title":"Zyla Text Spam Checker","year":"2023"},{"key":"ref90","volume-title":"SpamFiltering System","year":"2023"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.5555\/3295222.3295349"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"ref93","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2005.06.042"},{"key":"ref94","doi-asserted-by":"publisher","DOI":"10.3390\/fi11120255"},{"key":"ref95","article-title":"Cross-lingual language model pretraining","volume-title":"Proc. ANIPS","author":"Conneau"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10380310\/10431737.pdf?arnumber=10431737","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,31]],"date-time":"2024-08-31T05:28:29Z","timestamp":1725082109000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10431737\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":95,"URL":"https:\/\/doi.org\/10.1109\/access.2024.3364671","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]}}}