Search Results for author:
Found 3 papers, 3 papers with code
Permutation-Invariant Subgraph Discovery
PSPI can be viewed as a robust formulation of the permutation inference or graph matching, where the objective is to find a permutation between two graphs under the assumption that a set of edges may have undergone a perturbation due to an underlying cause.
Recurrent Attention Walk for Semi-supervised Classification
We propose to explore the neighborhood in a reinforcement learning setting and find a walk path well-tuned for classifying the unlabelled target nodes.
Collaborative Graph Walk for Semi-supervised Multi-Label Node Classification
In this work, we study semi-supervised multi-label node classification problem in attributed graphs.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
