SigGAN: Adversarial Model for Learning Signed Relationships in Networks

Author:

Chakraborty Roshni1ORCID,Das Ritwika2ORCID,Chandra Joydeep1ORCID

Affiliation:

1. Indian Institute of Technology Patna, Patna, India

2. National Institute of Technology Durgapur, Durgapur, India

Abstract

Signed link prediction in graphs is an important problem that has applications in diverse domains. It is a binary classification problem that predicts whether an edge between a pair of nodes is positive or negative. Existing approaches for link prediction in unsigned networks cannot be directly applied for signed link prediction due to their inherent differences. Furthermore, signed link prediction must consider the inherent characteristics of signed networks, such as structural balance theory. Recent signed link prediction approaches generate node representations using either generative models or discriminative models. Inspired by the recent success of Generative Adversarial Network (GAN) based models in several applications, we propose a GAN based model for signed networks, SigGAN. It considers the inherent characteristics of signed networks, such as integration of information from negative edges, high imbalance in number of positive and negative edges, and structural balance theory. Comparing the performance with state-of-the-art techniques on five real-world datasets validates the effectiveness of SigGAN.

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science

Reference80 articles.

1. Priyanka Agrawal, Vikas K. Garg, and Ramasuri Narayanam. 2013. Link label prediction in signed social networks. In Proceedings of the 23rd International Joint Conference on Artificial Intelligence. 2591–2597.

2. Ghazaleh Beigi, Jiliang Tang, and Huan Liu. 2016. Signed link analysis in social media networks. In Proceedings of the International AAAI Conference on Web and Social Media. 539–542.

3. Ayan Kumar Bhowmick, Koushik Meneni, and Bivas Mitra. 2019. On the network embedding in sparse signed networks. In Proceedings of the Pacific-Asia Conference on Knowledge Discovery and Data Mining. Springer, 94–106.

4. Structural balance: a generalization of Heider's theory.

5. Rating Augmentation with Generative Adversarial Networks towards Accurate Collaborative Filtering

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3