GESF: A Universal Discriminative Mapping Mechanism for Graph Representation Learning

28 May 2018Shupeng GuiXiangliang ZhangShuang QiuMingrui WuJieping YeJi Liu

Graph embedding is a central problem in social network analysis and many other applications, aiming to learn the vector representation for each node. While most existing approaches need to specify the neighborhood and the dependence form to the neighborhood, which may significantly degrades the flexibility of representation, we propose a novel graph node embedding method (namely GESF) via the set function technique... (read more)

PDF Abstract

Results from the Paper

  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.