Hostname: page-component-89b8bd64d-nlwjb Total loading time: 0 Render date: 2026-05-06T03:38:52.785Z Has data issue: false hasContentIssue false

Detecting sexual predators in chats using behavioral features and imbalanced learning*

Published online by Cambridge University Press:  31 January 2017

CLAUDIA CARDEI
Affiliation:
Department of Computer Science, University Politehnica of Bucharest, 060042 Bucharest, Romania e-mails: claudia.cardei@gmail.com, traian.rebedea@cs.pub.ro
TRAIAN REBEDEA
Affiliation:
Department of Computer Science, University Politehnica of Bucharest, 060042 Bucharest, Romania e-mails: claudia.cardei@gmail.com, traian.rebedea@cs.pub.ro

Abstract

This paper presents a system developed for detecting sexual predators in online chat conversations using a two-stage classification and behavioral features. A sexual predator is defined as a person who tries to obtain sexual favors in a predatory manner, usually with underage people. The proposed approach uses several text categorization methods and empirical behavioral features developed especially for the task at hand. After investigating various approaches for solving the sexual predator identification problem, we have found that a two-stage classifier achieves the best results. In the first stage, we employ a Support Vector Machine classifier to distinguish conversations having suspicious content from safe online discussions. This is useful as most chat conversations in real life do not contain a sexual predator, therefore it can be viewed as a filtering phase that enables the actual detection of predators to be done only for suspicious chats that contain a sexual predator with a very high degree. In the second stage, we detect which of the users in a suspicious discussion is an actual predator using a Random Forest classifier. The system was tested on the corpus provided by the PAN 2012 workshop organizers and the results are encouraging because, as far as we know, our solution outperforms all previous approaches developed for solving this task.

Information

Type
Articles
Copyright
Copyright © Cambridge University Press 2017 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable