基于复杂网络的垃圾短信过滤模型

IF 4.4 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Shaghayegh Hosseinpour, Hadi Shakibian
{"title":"基于复杂网络的垃圾短信过滤模型","authors":"Shaghayegh Hosseinpour,&nbsp;Hadi Shakibian","doi":"10.1016/j.comnet.2024.110892","DOIUrl":null,"url":null,"abstract":"<div><div>With the advancement of technology and the widespread use of mobile phones and wireless communication, SMS has become the most popular texting method due to its high response rate, affordability, and no internet connection requirement. A survey found that 3.5 billion users, or 80% of active users worldwide, use SMS for communication. SMS, however, has also attracted spammers, resulting in an explosion in spam messages, especially in Asia. Users are annoyed, lose money, and waste their time by receiving spam messages intended to serve various purposes, such as advertising, adult content, smishing, and fraud. Spam messages are a problem for users and providers, which calls for a mechanism to identify and filter them out. With supervised machine learning techniques, we propose a novel approach to classify spam and ham messages based on complex network theory. The proposed approach integrates complex network based features with statistical TF-IDF and grammatical rules features. Also, an under-sampling method has been employed in order to cope with the imbalanced data issue. We evaluated the performance of several supervised learners in terms of accuracy, precision, recall, F1-score, and AUC. In our experiments, Random Forest successfully classified spam messages more accurate than statistical methods that only extracted TF-IDF features.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"255 ","pages":"Article 110892"},"PeriodicalIF":4.4000,"publicationDate":"2024-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Complex-network based model for SMS spam filtering\",\"authors\":\"Shaghayegh Hosseinpour,&nbsp;Hadi Shakibian\",\"doi\":\"10.1016/j.comnet.2024.110892\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>With the advancement of technology and the widespread use of mobile phones and wireless communication, SMS has become the most popular texting method due to its high response rate, affordability, and no internet connection requirement. A survey found that 3.5 billion users, or 80% of active users worldwide, use SMS for communication. SMS, however, has also attracted spammers, resulting in an explosion in spam messages, especially in Asia. Users are annoyed, lose money, and waste their time by receiving spam messages intended to serve various purposes, such as advertising, adult content, smishing, and fraud. Spam messages are a problem for users and providers, which calls for a mechanism to identify and filter them out. With supervised machine learning techniques, we propose a novel approach to classify spam and ham messages based on complex network theory. The proposed approach integrates complex network based features with statistical TF-IDF and grammatical rules features. Also, an under-sampling method has been employed in order to cope with the imbalanced data issue. We evaluated the performance of several supervised learners in terms of accuracy, precision, recall, F1-score, and AUC. In our experiments, Random Forest successfully classified spam messages more accurate than statistical methods that only extracted TF-IDF features.</div></div>\",\"PeriodicalId\":50637,\"journal\":{\"name\":\"Computer Networks\",\"volume\":\"255 \",\"pages\":\"Article 110892\"},\"PeriodicalIF\":4.4000,\"publicationDate\":\"2024-11-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Networks\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1389128624007242\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1389128624007242","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

摘要

随着技术的进步以及手机和无线通信的广泛使用,短信因其回复率高、价格低廉、无需互联网连接等优点而成为最受欢迎的发短信方式。一项调查发现,全球有 35 亿用户,即 80% 的活跃用户使用短信进行通信。然而,短信也吸引了垃圾邮件发送者,导致垃圾邮件激增,尤其是在亚洲。用户收到的垃圾短信有各种目的,如广告、成人内容、钓鱼和欺诈等,使他们感到烦恼、损失金钱和浪费时间。垃圾邮件对用户和提供商都是一个问题,因此需要一种机制来识别和过滤它们。通过有监督的机器学习技术,我们提出了一种基于复杂网络理论的垃圾邮件和垃圾信息分类新方法。该方法将基于复杂网络的特征与统计 TF-IDF 和语法规则特征相结合。此外,为了应对不平衡数据问题,我们还采用了低采样方法。我们从准确率、精确度、召回率、F1-score 和 AUC 等方面评估了几种监督学习器的性能。在我们的实验中,与只提取 TF-IDF 特征的统计方法相比,随机森林成功地对垃圾邮件进行了更准确的分类。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Complex-network based model for SMS spam filtering
With the advancement of technology and the widespread use of mobile phones and wireless communication, SMS has become the most popular texting method due to its high response rate, affordability, and no internet connection requirement. A survey found that 3.5 billion users, or 80% of active users worldwide, use SMS for communication. SMS, however, has also attracted spammers, resulting in an explosion in spam messages, especially in Asia. Users are annoyed, lose money, and waste their time by receiving spam messages intended to serve various purposes, such as advertising, adult content, smishing, and fraud. Spam messages are a problem for users and providers, which calls for a mechanism to identify and filter them out. With supervised machine learning techniques, we propose a novel approach to classify spam and ham messages based on complex network theory. The proposed approach integrates complex network based features with statistical TF-IDF and grammatical rules features. Also, an under-sampling method has been employed in order to cope with the imbalanced data issue. We evaluated the performance of several supervised learners in terms of accuracy, precision, recall, F1-score, and AUC. In our experiments, Random Forest successfully classified spam messages more accurate than statistical methods that only extracted TF-IDF features.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computer Networks
Computer Networks 工程技术-电信学
CiteScore
10.80
自引率
3.60%
发文量
434
审稿时长
8.6 months
期刊介绍: Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信