VEWS: A Wikipedia Vandal Early Warning System
July 05, 2015 ยท Declared Dead ยท ๐ Knowledge Discovery and Data Mining
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Srijan Kumar, Francesca Spezzano, V. S. Subrahmanian
arXiv ID
1507.01272
Category
cs.SI: Social & Info Networks
Cross-listed
physics.soc-ph
Citations
96
Venue
Knowledge Discovery and Data Mining
Last Checked
3 months ago
Abstract
We study the problem of detecting vandals on Wikipedia before any human or known vandalism detection system reports flagging potential vandals so that such users can be presented early to Wikipedia administrators. We leverage multiple classical ML approaches, but develop 3 novel sets of features. Our Wikipedia Vandal Behavior (WVB) approach uses a novel set of user editing patterns as features to classify some users as vandals. Our Wikipedia Transition Probability Matrix (WTPM) approach uses a set of features derived from a transition probability matrix and then reduces it via a neural net auto-encoder to classify some users as vandals. The VEWS approach merges the previous two approaches. Without using any information (e.g. reverts) provided by other users, these algorithms each have over 85% classification accuracy. Moreover, when temporal recency is considered, accuracy goes to almost 90%. We carry out detailed experiments on a new data set we have created consisting of about 33K Wikipedia users (including both a black list and a white list of editors) and containing 770K edits. We describe specific behaviors that distinguish between vandals and non-vandals. We show that VEWS beats ClueBot NG and STiki, the best known algorithms today for vandalism detection. Moreover, VEWS detects far more vandals than ClueBot NG and on average, detects them 2.39 edits before ClueBot NG when both detect the vandal. However, we show that the combination of VEWS and ClueBot NG can give a fully automated vandal early warning system with even higher accuracy.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
๐ Similar Papers
In the same crypt โ Social & Info Networks
R.I.P.
๐ป
Ghosted
R.I.P.
๐ป
Ghosted
node2vec: Scalable Feature Learning for Networks
R.I.P.
๐ป
Ghosted
Cooperative Game Theory Approaches for Network Partitioning
R.I.P.
๐ป
Ghosted
From Louvain to Leiden: guaranteeing well-connected communities
R.I.P.
๐ป
Ghosted
Fake News Detection on Social Media: A Data Mining Perspective
R.I.P.
๐ป
Ghosted
Heterogeneous Graph Attention Network
Died the same way โ ๐ป Ghosted
R.I.P.
๐ป
Ghosted
Language Models are Few-Shot Learners
R.I.P.
๐ป
Ghosted
PyTorch: An Imperative Style, High-Performance Deep Learning Library
R.I.P.
๐ป
Ghosted
XGBoost: A Scalable Tree Boosting System
R.I.P.
๐ป
Ghosted