TY - JOUR
T1 - Improving network embedding with partially available vertex and edge content
AU - Lan, Lin
AU - Wang, Pinghui
AU - Zhao, Junzhou
AU - Tao, Jing
AU - Lui, John C.S.
AU - Guan, Xiaohong
N1 - KAUST Repository Item: Exported on 2022-06-21
Acknowledgements: The research presented in this paper is supported in part by Shenzhen Basic Research Grant (JCYJ20170816100819428), National Key R&D Program of China (2018YFC0830500), National Natural Science Foundation of China (61922067, U1736205, 61603290), Natural Science Basic Research Plan in Shaanxi Province of China (2019JM-159), and Natural Science Basic Research Plan in Zhejiang Province of China (LGG18F020016).
PY - 2019/12/2
Y1 - 2019/12/2
N2 - Network embedding aims to learn a low-dimensional representation for each vertex in a network, which has recently shown its power in many graph mining problems such as vertex classification and link prediction. Most existing methods learn such representations according to network structure information, and some methods further consider vertex content in a network. Unlike prior works, we study the problem of network embedding with two distinctive properties: (1) content information exists on both vertices and edges; (2) only a part of vertices and edges have content information. To solve this problem, we propose a novel Partially available Vertex and Edge Content Boosted network embedding method, namely PVECB, which uses available vertex and edge content information to fine-tune structure-only representations through two hand-designed mechanisms respectively. Empirical results on four real-world datasets demonstrate that our method can effectively boost structure-only representations to capture more accurate proximities between vertices.
AB - Network embedding aims to learn a low-dimensional representation for each vertex in a network, which has recently shown its power in many graph mining problems such as vertex classification and link prediction. Most existing methods learn such representations according to network structure information, and some methods further consider vertex content in a network. Unlike prior works, we study the problem of network embedding with two distinctive properties: (1) content information exists on both vertices and edges; (2) only a part of vertices and edges have content information. To solve this problem, we propose a novel Partially available Vertex and Edge Content Boosted network embedding method, namely PVECB, which uses available vertex and edge content information to fine-tune structure-only representations through two hand-designed mechanisms respectively. Empirical results on four real-world datasets demonstrate that our method can effectively boost structure-only representations to capture more accurate proximities between vertices.
UR - http://hdl.handle.net/10754/679198
UR - https://linkinghub.elsevier.com/retrieve/pii/S0020025519309466
UR - http://www.scopus.com/inward/record.url?scp=85074428036&partnerID=8YFLogxK
U2 - 10.1016/j.ins.2019.09.083
DO - 10.1016/j.ins.2019.09.083
M3 - Article
SN - 0020-0255
VL - 512
SP - 935
EP - 951
JO - Information Sciences
JF - Information Sciences
ER -