Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Adaptive Graph-based algorithms for Spam Detection in Social Networks
KTH, School of Electrical Engineering (EES), Communication Networks. (SCS/ICT)ORCID iD: 0000-0002-0264-8762
KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS. (SCS/ICT)ORCID iD: 0000-0003-4516-7317
2016 (English)Report (Other academic)
Abstract [en]

As Online Social Networks (OSNs) continue to grow in popularity, a spam marketplace has emerged that includes services selling fraudulent accounts, as well as acts as nucleus of spammers who propagate large-scale spam campaigns. In the past years, researchers developed approaches to detect spam such as URL blacklisting, spam traps and even crowdsourcing for manual classification. Although previous work has shown the effectiveness of using statistical learning to detect spam, existing work employs supervised schemes that require labeled training data. In addition to the heavy training cost, it is difficult to obtain a comprehensive source of ground truth for measurement. In contrast to existing work, in this paper we present a novel graph-based approach for spam detection. Our approach is unsupervised, hence it diminishes the need of labeled training data and training cost. Particularly, our approach can effectively detect the spam in large-scale OSNs by analyzing user behaviors using graph clustering technique. Moreover, our approach continuously updates detected communities to comply with dynamic OSNs where interactions and activities are evolving rapidly. Extensive experiments using Twitter datasets show that our approach is able to detect spam with accuracy 92.3\%. Furthermore, our approach has false positive rate that is less than 0.3\% that is less than half of the rate achieved by the state-of-the-art approaches.

Place, publisher, year, edition, pages
KTH Royal Institute of Technology, 2016.
Keyword [en]
Distributed Systems, Graphs and networks, Graph algorithms, Spam Detection, Social Networks
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:kth:diva-193135OAI: oai:DiVA.org:kth-193135DiVA: diva2:998690
Projects
iSocial
Note

QC 20161005

Available from: 2016-09-29 Created: 2016-09-29 Last updated: 2016-10-05Bibliographically approved

Open Access in DiVA

fulltext(1068 kB)189 downloads
File information
File name FULLTEXT01.pdfFile size 1068 kBChecksum SHA-512
588ad25d42da98fdd2a302fb83038088e25b0ac035a051d1c98276b7be566810b886ef14ca127e5a4afd1c6fc2ed43c23e523be77fc676cfef77f817a5dd6cd0
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Soliman, AmiraGirdzijauskas, Sarunas
By organisation
Communication NetworksSoftware and Computer systems, SCS
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 189 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 916 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf