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

IEEE Transactions on Pattern Analysis and Machine Intelligence(2022)

引用 14|浏览157
暂无评分
摘要
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, recommendation, community detection). The key problem in graph node embedding lies in how to define the dependence to neighbors. Existing approaches specify (either explicitly or implicitly) certain dependencies on neighbors, ...
更多
查看译文
关键词
Task analysis,Laplace equations,Aggregates,Reinforcement learning,Matrix decomposition,Graph neural networks,Games
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要