Name
Abstract | ||
|---|---|---|
Network embedding is an influential graph mining technique for representing nodes in a graph as distributed vectors. However, the majority of network embedding methods focus on learning a single vector representation for each node, which has been recently criticized for not being capable of modeling multiple aspects of a node. To capture the multiple aspects of each node, existing studies mainly rely on offline graph clustering performed prior to the actual embedding, which results in the cluster membership of each node (i.e., node aspect distribution) fixed throughout training of the embedding model. We argue that this not only makes each node always have the same aspect distribution regardless of its dynamic context, but also hinders the end-to-end training of the model that eventually leads to the final embedding quality largely dependent on the clustering. In this paper, we propose a novel end-to-end framework for multi-aspect network embedding, called asp2vec, in which the aspects of each node are dynamically assigned based on its local context. More precisely, among multiple aspects, we dynamically assign a single aspect to each node based on its current context, and our aspect selection module is end-to-end differentiable via the Gumbel-Softmax trick. We also introduce the aspect regularization framework to capture the interactions among the multiple aspects in terms of relatedness and diversity. We further demonstrate that our proposed framework can be readily extended to heterogeneous networks. Extensive experiments towards various downstream tasks on various types of homogeneous networks and a heterogeneous network demonstrate the superiority of asp2vec.
|
Year | DOI | Venue |
|---|---|---|
2020 | 10.1145/3394486.3403196 | KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining
Virtual Event
CA
USA
July, 2020 |
DocType | ISBN | Citations |
Conference | 978-1-4503-7998-4 | 1 |
PageRank | References | Authors |
0.35 | 25 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chanyoung Park | 1 | 163 | 12.04 |
| Carl Yang | 2 | 196 | 17.33 |
| Qi Zhu | 3 | 27 | 3.78 |
| Dong Hyun Kim | 4 | 164 | 7.55 |
| Hwanjo Yu | 5 | 1715 | 114.02 |
| Jiawei Han | 6 | 43085 | 3824.48 |