Attacking Similarity-Based Sign Prediction

Michal Tomasz Godziszewski, Tomasz P. Michalak, Marcin Waniek, Talal Rahwan, Kai Zhou, Yulin Zhu

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

Abstract

In this paper, we present a computational analysis of the problem of attacking sign prediction, whereby the aim of the attacker (a network member) is to hide from the defender (an analyst) the signs of a target set of links by removing the signs of some other, non-target, links. The problem turns out to be NP-hard if either local or global similarity measures are used for sign prediction. We propose a heuristic algorithm and test its effectiveness on several real-life and synthetic datasets.
Original languageEnglish
Title of host publicationProceedings - 21st IEEE International Conference on Data Mining, ICDM 2021
EditorsJames Bailey, Pauli Miettinen, Yun Sing Koh, Dacheng Tao, Xindong Wu
PublisherIEEE
Pages1072-1077
Number of pages6
ISBN (Electronic)9781665423984
ISBN (Print)978-1-6654-2398-4
DOIs
Publication statusPublished - Dec 2021

Publication series

NameProceedings - IEEE International Conference on Data Mining, ICDM
Volume2021-December
ISSN (Print)1550-4786

Keywords

  • complexity
  • link prediction
  • networks
  • np-hardness
  • sign prediction
  • similarity measures

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint

Dive into the research topics of 'Attacking Similarity-Based Sign Prediction'. Together they form a unique fingerprint.

Cite this