Abstract
AbstractIn this article we give a comprehensive overview of features devised for web spam detection and investigate how much various classes, some requiring very high computational effort, add to the classification accuracy. We collect and handle a large number of features based on recent advances in web spam filtering, including temporal ones; in particular, we analyze the strength and sensitivity of linkage change.We propose new, temporal link-similarity-based features and show how to compute them efficiently on large graphs.We show that machine learning techniques, including ensemble selection, LogitBoost, and random forest significantly improve accuracy.We conclude that, with appropriate learning techniques, a simple and computationally inexpensive feature subset outperforms all previous results published so far on our dataset and can be further improved only slightly by computationally expensive features.We test our method on three major publicly available datasets: the Web Spam Challenge 2008 datase...
Published Version (Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have