TY - GEN
T1 - Relation learning on social networks with multi-modal graph edge variational autoencoders
AU - Yang, Carl
AU - Zhang, Jieyu
AU - Wang, Haonan
AU - Li, Sha
AU - Kim, Myungwan
AU - Walker, Matt
AU - Xiao, Yiou
AU - Han, Jiawei
N1 - Publisher Copyright:
© 2020 Association for Computing Machinery.
PY - 2020/1/20
Y1 - 2020/1/20
N2 - While node semantics have been extensively explored in social networks, little research attention has been paid to profile edge semantics, i.e., social relations. Ideal edge semantics should not only show that two users are connected, but also why they know each other and what they share in common. However, relations in social networks are often hard to profile, due to noisy multi-modal signals and limited user-generated ground-truth labels. In this work, we aim to develop a unified and principled framework that can profile user relations as edge semantics in social networks by integrating multi-modal signals in the presence of noisy and incomplete data. Our framework is also flexible towards limited or missing supervision. Specifically, we assume a latent distribution of multiple relations underlying each user link, and learn them with multi-modal graph edge variational autoencoders. We encode the network data with a graph convolutional network, and decode arbitrary signals with multiple reconstruction networks. Extensive experiments and case studies on two public DBLP author networks and two internal LinkedIn member networks demonstrate the superior effectiveness and efficiency of our proposed model.
AB - While node semantics have been extensively explored in social networks, little research attention has been paid to profile edge semantics, i.e., social relations. Ideal edge semantics should not only show that two users are connected, but also why they know each other and what they share in common. However, relations in social networks are often hard to profile, due to noisy multi-modal signals and limited user-generated ground-truth labels. In this work, we aim to develop a unified and principled framework that can profile user relations as edge semantics in social networks by integrating multi-modal signals in the presence of noisy and incomplete data. Our framework is also flexible towards limited or missing supervision. Specifically, we assume a latent distribution of multiple relations underlying each user link, and learn them with multi-modal graph edge variational autoencoders. We encode the network data with a graph convolutional network, and decode arbitrary signals with multiple reconstruction networks. Extensive experiments and case studies on two public DBLP author networks and two internal LinkedIn member networks demonstrate the superior effectiveness and efficiency of our proposed model.
KW - Graph variational autoencoder
KW - Relation learning
KW - Social networks
UR - http://www.scopus.com/inward/record.url?scp=85079530841&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85079530841&partnerID=8YFLogxK
U2 - 10.1145/3336191.3371829
DO - 10.1145/3336191.3371829
M3 - Conference contribution
AN - SCOPUS:85079530841
T3 - WSDM 2020 - Proceedings of the 13th International Conference on Web Search and Data Mining
SP - 699
EP - 707
BT - WSDM 2020 - Proceedings of the 13th International Conference on Web Search and Data Mining
PB - Association for Computing Machinery
T2 - 13th ACM International Conference on Web Search and Data Mining, WSDM 2020
Y2 - 3 February 2020 through 7 February 2020
ER -