Learning Structural Node Embeddings via Diffusion Wavelets

被引:253
作者
Donnat, Claire [1 ]
Zitnik, Marinka [1 ]
Hallac, David [1 ]
Leskovec, Jure [1 ]
机构
[1] Stanford Univ, Stanford, CA 94305 USA
来源
KDD'18: PROCEEDINGS OF THE 24TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY & DATA MINING | 2018年
关键词
D O I
10.1145/3219819.3220025
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Nodes residing in different parts of a graph can have similar structural roles within their local network topology. The identification of such roles provides key insight into the organization of networks and can be used for a variety of machine learning tasks. However, learning structural representations of nodes is a challenging problem, and it has typically involved manually specifying and tailoring topological features for each node. In this paper, we develop GraphWave, a method that represents each node's network neighborhood via a low-dimensional embedding by leveraging heat wavelet diffusion patterns. Instead of training on hand-selected features, GraphWave learns these embeddings in an unsupervised way. We mathematically prove that nodes with similar network neighborhoods will have similar GraphWave embeddings even though these nodes may reside in very different parts of the network. GraphWave runtime scales linearly with the number of edges and experiments in a variety of different settings demonstrate GraphWave's real-world potential for capturing structural roles in networks. All in all, GraphWave outperforms existing state-of-the-art baselines in every experiment, by as much as 137%.
引用
收藏
页码:1320 / 1329
页数:10
相关论文
共 34 条
[1]  
[Anonymous], 2011, P 17 ACM SIGKDD INT, DOI 10.1145/2020408.2020512
[2]  
[Anonymous], 2004, Machine Learning
[3]  
[Anonymous], 2017, NIPS
[4]  
[Anonymous], 2011, SIGKDD
[5]  
[Anonymous], 2011, PROC INT C DISTRIB C, DOI DOI 10.1109/DCOSS.2011.5982158
[6]  
[Anonymous], 2016, P ADV NEUR INF PROC
[7]  
[Anonymous], 2017, PROC INT C LEARN REP
[8]  
[Anonymous], 1970, Characteristic Functions
[9]  
[Anonymous], 2012, P 18 ACM SIGKDD INT
[10]  
[Anonymous], 2017, ICML