TY - GEN
T1 - Dual-branch density ratio estimation for signed network embedding
AU - Xu, Pinghua
AU - Zhan, Yibing
AU - Liu, Liu
AU - Yu, Baosheng
AU - Du, Bo
AU - Wu, Jia
AU - Hu, Wenbin
PY - 2022/4
Y1 - 2022/4
N2 - Signed network embedding (SNE) has received considerable attention in recent years. A mainstream idea of SNE is to learn node representations by estimating the ratio of sampling densities. Though achieving promising performance, these methods based on density ratio estimation are limited to the issues of confusing sample, expected error, and fixed priori. To alleviate the above-mentioned issues, in this paper, we propose a novel dual-branch density ratio estimation (DDRE) architecture for SNE. Specifically, DDRE 1) consists of a dual-branch network, dealing with the confusing sample; 2) proposes the expected matrix factorization without sampling to avoid the expected error; and 3) devises an adaptive cross noise sampling to alleviate the fixed priori. We perform sign prediction and node classification experiments on four real-world and three artificial datasets, respectively. Extensive empirical results demonstrate that DDRE not only significantly outperforms the methods based on density ratio estimation but also achieves competitive performance compared with other types of methods such as graph likelihood, generative adversarial networks, and graph convolutional networks. Code is publicly available at https://github.com/WHU-SNA/DDRE.
AB - Signed network embedding (SNE) has received considerable attention in recent years. A mainstream idea of SNE is to learn node representations by estimating the ratio of sampling densities. Though achieving promising performance, these methods based on density ratio estimation are limited to the issues of confusing sample, expected error, and fixed priori. To alleviate the above-mentioned issues, in this paper, we propose a novel dual-branch density ratio estimation (DDRE) architecture for SNE. Specifically, DDRE 1) consists of a dual-branch network, dealing with the confusing sample; 2) proposes the expected matrix factorization without sampling to avoid the expected error; and 3) devises an adaptive cross noise sampling to alleviate the fixed priori. We perform sign prediction and node classification experiments on four real-world and three artificial datasets, respectively. Extensive empirical results demonstrate that DDRE not only significantly outperforms the methods based on density ratio estimation but also achieves competitive performance compared with other types of methods such as graph likelihood, generative adversarial networks, and graph convolutional networks. Code is publicly available at https://github.com/WHU-SNA/DDRE.
KW - network embedding
KW - signed network
KW - signed proximity
UR - https://www.scopus.com/pages/publications/85129838685
UR - http://purl.org/au-research/grants/arc/DE200100964
U2 - 10.1145/3485447.3512171
DO - 10.1145/3485447.3512171
M3 - Conference proceeding contribution
AN - SCOPUS:85129838685
T3 - WWW 2022 - Proceedings of the ACM Web Conference 2022
SP - 1651
EP - 1662
BT - WWW 2022 - Proceedings of the ACM Web Conference 2022
PB - Association for Computing Machinery (ACM)
CY - New York, NY
T2 - 31st ACM World Wide Web Conference, WWW 2022
Y2 - 25 April 2022 through 29 April 2022
ER -