| Title | From Properties to Links: Deep Network Embedding on Incomplete Graphs |
| Publication Type | Conference Paper |
| Year of Publication | 2017 |
| Authors | Yang, Dejian, Wang, Senzhang, Li, Chaozhuo, Zhang, Xiaoming, Li, Zhoujun |
| Conference Name | Proceedings of the 2017 ACM on Conference on Information and Knowledge Management |
| Publisher | ACM |
| Conference Location | New York, NY, USA |
| ISBN Number | 978-1-4503-4918-5 |
| Keywords | composability, Deep Learning, incomplete graph, network embedding, pubcrawl, trustworthiness |
| Abstract | As an effective way of learning node representations in networks, network embedding has attracted increasing research interests recently. Most existing approaches use shallow models and only work on static networks by extracting local or global topology information of each node as the algorithm input. It is challenging for such approaches to learn a desirable node representation on incomplete graphs with a large number of missing links or on dynamic graphs with new nodes joining in. It is even challenging for them to deeply fuse other types of data such as node properties into the learning process to help better represent the nodes with insufficient links. In this paper, we for the first time study the problem of network embedding on incomplete networks. We propose a Multi-View Correlation-learning based Deep Network Embedding method named MVC-DNE to incorporate both the network structure and the node properties for more effectively and efficiently perform network embedding on incomplete networks. Specifically, we consider the topology structure of the network and the node properties as two correlated views. The insight is that the learned representation vector of a node should reflect its characteristics in both views. Under a multi-view correlation learning based deep autoencoder framework, the structure view and property view embeddings are integrated and mutually reinforced through both self-view and cross-view learning. As MVC-DNE can learn a representation mapping function, it can directly generate the representation vectors for the new nodes without retraining the model. Thus it is especially more efficient than previous methods. Empirically, we evaluate MVC-DNE over three real network datasets on two data mining applications, and the results demonstrate that MVC-DNE significantly outperforms state-of-the-art methods. |
| URL | http://doi.acm.org/10.1145/3132847.3132975 |
| DOI | 10.1145/3132847.3132975 |
| Citation Key | yang_properties_2017 |
From Properties to Links: Deep Network Embedding on Incomplete Graphs