Signed Network Modeling Based on Structural Balance Theory

被引:37
作者
Derr, Tyler [1 ]
Aggarwal, Charu [2 ]
Tang, Jiliang [1 ]
机构
[1] Michigan State Univ, Data Sci & Engn Lab, E Lansing, MI 48824 USA
[2] IBM TJ Watson Res Ctr, Yorktown Hts, NY USA
来源
CIKM'18: PROCEEDINGS OF THE 27TH ACM INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT | 2018年
基金
美国国家科学基金会;
关键词
Signed Networks; Network Modeling; Balance Theory; GRAPHS;
D O I
10.1145/3269206.3271746
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The modeling of networks, specifically generative models, has been shown to provide a plethora of information about the underlying network structures, as well as many other benefits behind their construction. There has been a considerable increase in interest for the better understanding and modeling of networks, and the vast majority of existing work has been for unsigned networks. However, many networks can have positive and negative links (or signed networks), especially in online social media. It is evident from recent work that signed networks present unique properties and principles from unsigned networks due to the added complexity, which pose tremendous challenges on existing unsigned network models. Hence, in this paper, we investigate the problem of modeling signed networks. In particular, we provide a principled approach to capture important properties and principles of signed networks and propose a novel signed network model guided by Structural Balance Theory. Empirical experiments on three real-world signed networks demonstrate the effectiveness of the proposed model.
引用
收藏
页码:557 / 566
页数:10
相关论文
共 38 条
[1]  
[Anonymous], 2018, INT C MACH LEARN
[2]  
[Anonymous], 2010, P INT C WORLD WID WE
[3]  
[Anonymous], 2018, MolGAN: an implicit generative model for small molecular graphs.
[4]  
[Anonymous], 2013, P 6 ACM INT C WEB SE
[5]  
[Anonymous], 2017, P 2017 SIAM INT C DA
[6]  
[Anonymous], P 2018 IEEE ACM INT
[7]  
[Anonymous], P R SOC B
[8]  
[Anonymous], 2012, LEARNING DISCOVER SO
[9]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[10]  
Barabasi Albert-Laszlo, 2004, NATURE REV GENETICS, V5, P2