direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Anwendungen

Konferenzpublikationen

Tag Spam Creates Large Non-Giant Connected Components
Zitatschlüssel Neubauer20090
Autor Neubauer, N. and Wetzker, R. and Obermayer, K.
Buchtitel AIRWeb '09 Proceedings of the 5th International Workshop on Adversarial Information Retrieval on the Web
Seiten 49 – 52
Jahr 2009
ISBN 978-1-60558-438-6
DOI 10.1145/1531914.1531925
Verlag Association for Computing Machinery
Zusammenfassung Spammers in social bookmarking systems try to mimick bookmarking behaviour of real users to gain the attention of other users or search engines. Several methods have been proposed for the detection of such spam, including domain-specific features (like URL terms) or similarity of users to previously identified spammers. However, as shown in our previous work, it is possible to identify a large fraction of spam users based on purely structural features. The hypergraph connecting documents, users, and tags can be decomposed into connected components, and any large, but non-giant components turned out to be almost entirely inhabitated by spam users in the examined dataset. Here, we test to what degree the decomposition of the complete hypergraph is really necessary, examining the component structure of the induced user/document and user/tag graphs. While the user/tag graph's connectivity does not help in classifying spammers, the user/document graph's connectivity is already highly informative. It can however be augmented with connectivity information from the hypergraph. In our view, spam detection based on structural features, like the one proposed here, requires complex adaptation strategies from spammers and may complement other, more traditional detection approaches.
Link zur Originalpublikation Download Bibtex Eintrag

Zusatzinformationen / Extras

Direktzugang:

Schnellnavigation zur Seite über Nummerneingabe