ADMIRING: Adversarial Multi-network Mining
Authors:
- 1 November 2019
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1522-1527
Abstract
Multi-sourced networks naturally appear in many application domains, ranging from bioinformatics, social networks, neuroscience to management. Although state-of-the-art offers rich models and algorithms to find various patterns when input networks are given, it has largely remained nascent on how vulnerable the mining results are due to the adversarial attacks. In this paper, we address the problem of attacking multi-network mining through the way of deliberately perturbing the networks to alter the mining results. The key idea of the proposed method (Admiring) is effective influence functions on the Sylvester equation defined over the input networks, which plays a central and unifying role in various multi-network mining tasks. The proposed algorithms bear two main advantages, including (1) effectiveness, being able to accurately quantify the rate of change of the mining results in response to attacks; and (2) generality, being applicable to a variety of multi-network mining tasks ( e.g., graph kernel, network alignment, cross-network node similarity) with different attacking strategies (e.g., edge/node removal, attribute alteration).Keywords
This publication has 17 references indexed in Scilit:
- FINAL2016
- On the Connectivity of Multi-layered Networks: Models, Measures and Optimal Control2015
- Deep Graph Kernels2015
- Flexible and Robust Multi-Network Clustering2015
- Replacing the Irreplaceable2015
- Inside the atoms2014
- Protein function prediction via graph kernelsBioinformatics, 2005
- Derivation and Validation of Toxicophores for Mutagenicity PredictionJournal of Medicinal Chemistry, 2004
- Solution of the Sylvester matrix equation AXB
T
+ CXD
T
= EACM Transactions on Mathematical Software, 1992
- The 1972 Wald Lecture Robust Statistics: A ReviewThe Annals of Mathematical Statistics, 1972