Choosing which link queries to verify can prevent most of the damage from targeted edge-deletion attacks on similarity-based link prediction, even though the optimal choice is NP-hard to compute.
Generation of uncorrelated random scale-free networks
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.AI 1years
2019 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Adversarial Robustness of Similarity-Based Link Prediction
Choosing which link queries to verify can prevent most of the damage from targeted edge-deletion attacks on similarity-based link prediction, even though the optimal choice is NP-hard to compute.