Search Results for author:
Found 2 papers, 2 papers with code
Adversarial Examples on Graph Data: Deep Insights into Attack and Defense
Based on this observation, we propose a defense approach which inspects the graph and recovers the potential adversarial perturbations.
Efficient Representation Learning Using Random Walks for Dynamic Graphs
In this work, we propose computationally efficient algorithms for vertex representation learning that extend random walk based methods to dynamic graphs.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
