most citedPINE: Universal Deep Embedding for Graph Nodes via Partial Permutation Invariant Set Functions

3 citations · 3 across the 1 of their papers we have counts for

collaborators

1 paper

cs.LG2019★ 3 cited

PINE: Universal Deep Embedding for Graph Nodes via Partial Permutation Invariant Set Functions

Shupeng Gui, Xiangliang Zhang, Pan Zhong +5

Graph node embedding aims at learning a vector representation for all nodes given a graph. It is a central problem in many machine learning tasks (e.g., node classification, recomm…