Signed networks represent the real world relationships, which are both positive or negative. Recent research works focus on either discriminative or generative based models for signed network embedding. In this paper, we propose a generative adversarial network (GAN) model for signed network which unifies generative and discriminative models to generate the node embedding. Our experimental evaluations on several datasets, like Slashdot, Epinions, Reddit, Bitcoin and Wiki-RFA indicates that the proposed approach ensures better macro F1-score than the existing state-of-the-art approaches in link prediction and handling of sparsity of signed networks.
|Titel||Proceedings of the 31st ACM Conference on Hypertext and Social Media, HT 2020|
|Forlag||Association for Computing Machinery|
|Publikationsdato||13 jul. 2020|
|Status||Udgivet - 13 jul. 2020|
|Begivenhed||31st ACM Conference on Hypertext and Social Media, HT 2020 - Virtual, Online, USA|
Varighed: 13 jul. 2020 → 15 jul. 2020
|Konference||31st ACM Conference on Hypertext and Social Media, HT 2020|
|Periode||13/07/2020 → 15/07/2020|
|Sponsor||ACM Special Interest Group on Computer-Human Interaction (SIGCHI), ACM Special Interest Group on Hypertext, Hypermedia, and Web (SIGWEB)|
Bibliografisk notePublisher Copyright:
© 2020 Owner/Author.