Name
Abstract | ||
|---|---|---|
Network embedding has attracted increasing attention in recent few years, which is to learn a low-dimensional representation for each node of a network to benefit downstream tasks, such as node classification, link prediction, and network visualization. Essentially, the task of network embedding can be decoupled into discovering the proximity in the original space and preserving it in the low dimensional space. Only with the well-discovered proximity can we preserve it in the low-dimensional space. Thus, it is critical to discover the proximity between different nodes to learn good node representations. To address this problem, in this paper, we propose a novel proximity generative adversarial network (ProGAN) which can generate proximities. As a result, the generated proximity can help to discover the complicated underlying proximity to benefit network embedding. To generate proximities, we design a novel neural network architecture to fulfill it. In particular, the generation of proximities is instantiated to the generation of triplets of nodes, which encodes the similarity relationship between different nodes. In this way, the proposed ProGAN can generate proximities successfully to benefit network embedding. At last, extensive experimental results have verified the effectiveness of ProGAN.
|
Year | DOI | Keywords |
|---|---|---|
2019 | 10.1145/3292500.3330866 | generative adversarial networks, nework embedding, proximity |
Field | DocType | ISSN |
Graph drawing,Data mining,Generative adversarial network,Computer science,Neural network architecture,Artificial intelligence,Network embedding | Conference | 978-1-4503-6201-6 |
ISBN | Citations | PageRank |
978-1-4503-6201-6 | 6 | 0.41 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hongchang Gao | 1 | 54 | 8.32 |
| Jian Pei | 2 | 19002 | 995.54 |
| Heng Huang | 3 | 3080 | 203.21 |