Name
Abstract | ||
|---|---|---|
Recent advances in the field of network embedding have shown that low-dimensional network representation is playing a critical role in network analysis. Most existing network embedding methods encode the local proximity of a node, such as the first- and second-order proximities. While being efficient, these methods are short of leveraging the global structural information between nodes distant from each other. In addition, most existing methods learn embeddings on one single fixed network, and thus cannot be generalized to unseen nodes or networks without retraining. In this paper we present SPINE, a method that can jointly capture the local proximity and proximities at any distance, while being inductive to efficiently deal with unseen nodes or networks. Specifically, we identify the structural identity of each node based on a high-order proximity of the network named Rooted PageRank, followed by a novel biased Skip-Gram Negative Sampling algorithm and a carefully designed objective function to encode local proximities and global structural identities of nodes simultaneously. Extensive experimental results on benchmark datasets demonstrate the superiority of the proposed framework over the state of the art. |
Year | Venue | Field |
|---|---|---|
2018 | arXiv: Social and Information Networks | Data mining,PageRank,ENCODE,Computer science,Sampling (statistics),Network embedding,Network analysis |
DocType | Volume | Citations |
Journal | abs/1802.03984 | 1 |
PageRank | References | Authors |
0.35 | 24 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Junliang Guo | 1 | 1 | 1.02 |
| Linli Xu | 2 | 790 | 42.51 |
| Enhong Chen | 3 | 2106 | 165.57 |