Ensemble Method for Sexual Predators Identification in Online Chats

M. Fauzi, Patrick A. H. Bours
{"title":"Ensemble Method for Sexual Predators Identification in Online Chats","authors":"M. Fauzi, Patrick A. H. Bours","doi":"10.1109/IWBF49977.2020.9107945","DOIUrl":null,"url":null,"abstract":"Cyber grooming is a compelling problem worldwide nowadays and many reports strongly suggested that it becomes very urgent to tackle this problem to protect the children from sexual exploitation. In this study, we propose an effective method for sexual predator identification in online chats based on two-stage classification. The purpose of the first stage is to distinguish predatory conversations from the normal ones while the second stage aims to tell apart between the predator user and the victim within a single predatory conversation. Finally, some unique predators are derived from the second stage result. We investigate several machine learning classifiers including Naive Bayes, Support Vector Machine, Neural Network, Logistic Regression, Random Forest, K-Nearest Neighbors, and Decision Tree with Bag of Words features using several different term weighting methods for this task. We also proposed two ensemble techniques to improve the classification task. The experiment results on PAN12 dataset show that our best method using soft voting based ensemble for first stage and Naive Bayes based method for the second stage obtained an F0.5-score of 0.9348, which would place as number one in the PAN12 competition ranking.","PeriodicalId":174654,"journal":{"name":"2020 8th International Workshop on Biometrics and Forensics (IWBF)","volume":"161 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 8th International Workshop on Biometrics and Forensics (IWBF)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWBF49977.2020.9107945","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 17

Abstract

Cyber grooming is a compelling problem worldwide nowadays and many reports strongly suggested that it becomes very urgent to tackle this problem to protect the children from sexual exploitation. In this study, we propose an effective method for sexual predator identification in online chats based on two-stage classification. The purpose of the first stage is to distinguish predatory conversations from the normal ones while the second stage aims to tell apart between the predator user and the victim within a single predatory conversation. Finally, some unique predators are derived from the second stage result. We investigate several machine learning classifiers including Naive Bayes, Support Vector Machine, Neural Network, Logistic Regression, Random Forest, K-Nearest Neighbors, and Decision Tree with Bag of Words features using several different term weighting methods for this task. We also proposed two ensemble techniques to improve the classification task. The experiment results on PAN12 dataset show that our best method using soft voting based ensemble for first stage and Naive Bayes based method for the second stage obtained an F0.5-score of 0.9348, which would place as number one in the PAN12 competition ranking.
在线聊天中识别性侵犯者的集成方法
网络诱骗是当今世界一个引人注目的问题,许多报告强烈建议,解决这个问题以保护儿童免受性剥削变得非常紧迫。在这项研究中,我们提出了一种基于两阶段分类的在线聊天中的性捕食者识别方法。第一阶段的目的是将掠夺性对话与正常对话区分开来,而第二阶段的目的是在一次掠夺性对话中区分掠夺性用户和受害者。最后,从第二阶段的结果推导出一些独特的捕食者。我们研究了几种机器学习分类器,包括朴素贝叶斯、支持向量机、神经网络、逻辑回归、随机森林、k近邻和具有词袋特征的决策树,使用了几种不同的术语加权方法来完成这项任务。我们还提出了两种集成技术来改进分类任务。在PAN12数据集上的实验结果表明,第一阶段采用基于软投票的集成方法,第二阶段采用基于朴素贝叶斯的方法,我们的最佳方法获得了0.9348的f0.5得分,在PAN12的竞争排名中名列第一。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信