Abstract
Signed social networks have both positive and negative links which convey rich information such as trust or distrust, like or dislike. However, existing network embedding methods mostly focus on unsigned networks and ignore the negative interactions between users. In this paper, we investigate the problem of learning representations for signed networks and present a novel deep network structure to incorporate both the balance and status theory in signed networks. With the proposed framework, we can simultaneously learn the node embedding encoding the status of a node and the edge embedding denoting the sign of an edge. Furthermore, the learnt node and edge embeddings can be directly applied to the sign prediction and node ranking tasks. Experiments on real-world social networks demonstrate that our model significantly outperforms the state-of-the-art baselines.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Change history
01 July 2018
The original version of this chapter titled “Free-Rider Episode Screening via Dual Partition Model” contained the following three mistakes:
- 1.
In table 1, row 2, column 3, the average occurrence per event on STK dataset was “1.037”. It should be “1,037”.
- 2.
The last model name in the legend of Figure 3 was “EIP”. It should be “EDP”.
- 3.
In the experiment part the stock symbols and their companies were confused.
In the updated version these mistakes were corrected.
In the originally published version of chapters titled “BASSI: Balance and Status Combined Signed Network Embedding” and “Sample Location Selection for Efficient Distance-Aware Influence Maximization in Geo-Social Networks” the funding information in the acknowledgement section was incomplete. This has now been corrected.
- 1.
References
Bottou, L.: Stochastic gradient learning in neural networks. Proc. Neuro-Nımes 91(8) (1991)
Brin, S., Page, L.: Reprint of: the anatomy of a large-scale hypertextual web search engine. Comput. Netw. 56(18), 3825–3833 (2012)
Chiang, K.Y., Natarajan, N., Tewari, A.: Exploiting longer cycles for link prediction in signed networks. In: Proceedings of CIKM, pp. 1157–1162 (2011)
Grover, A., Leskovec, J.: node2vec: Scalable feature learning for networks. In: Proceedings of SIGKDD, pp. 855–864 (2016)
Guha, R., Kumar, R., Raghavan, P., Tomkins, A.: Propagation of trust and distrust. In: Proceedings of WWW, pp. 403–412. ACM (2004)
Heider, F.: Attitudes and cognitive organization. J. Psychol. 21(1), 107–112 (1946)
de Kerchove, C., Van Dooren, P.: The PageTrust algorithm: how to rank web pages when negative links are allowed? In: Proceedings of SDM, pp. 346–352. SIAM (2008)
Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. JACM 46(5), 604–632 (1999)
Leskovec, J., Huttenlocher, D., Kleinberg, J.: Predicting positive and negative links in online social networks. In: Proceedings of WWW, pp. 641–650. ACM (2010)
Leskovec, J., Huttenlocher, D., Kleinberg, J.: Signed networks in social media. In: Proceedings of SIGCHI, pp. 1361–1370. ACM (2010)
Perozzi, B., Al-Rfou, R., Skiena, S.: Deepwalk: online learning of social representations. In: Proceedings of SIGKDD, pp. 701–710 (2014)
Shahriari, M., Jalili, M.: Ranking nodes in signed social networks. SNAM 4(1), 172 (2014)
Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J., Mei, Q.: Line: large-scale information network embedding. In: Proceedings of WWW, pp. 1067–1077 (2015)
Tang, J., Chang, S., Aggarwal, C., Liu, H.: Negative link prediction in social media. In: Proceedings of ICDM, pp. 87–96. ACM (2015)
Tang, J., Chang, Y., Aggarwal, C., Liu, H.: A survey of signed network mining in social media. ACM Comput. Surv. (CSUR) 49(3), 42 (2016)
Traag, V.A., Nesterov, Y.E., Van Dooren, P.: Exponential ranking: taking into account negative links. In: Bolc, L., Makowski, M., Wierzbicki, A. (eds.) SocInfo 2010. LNCS, vol. 6430, pp. 192–202. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-16567-2_14
Wang, S., Aggarwal, C., Tang, J., Liu, H.: Attributed signed network embedding. In: Proceedings of CIKM, pp. 137–146. ACM (2017)
Wang, S., Tang, J., Aggarwal, C., Chang, Y., Liu, H.: Signed network embedding in social media. In: Proceedings of SDM, pp. 327–335. SIAM (2017)
Wu, Z., Aggarwal, C.C., Sun, J.: The troll-trust model for ranking in signed networks. In: Proceedings of ICDM, pp. 447–456. ACM (2016)
Zolfaghar, K., Aghaie, A.: Mining trust and distrust relationships in social web applications. In: Proceedings of ICCP, pp. 73–80. IEEE (2010)
Acknowledgement
The work described in this paper has been supported in part by the NSFC projects (61572376, 91646206), the 111 project (B07037), and Natural Science Foundation of Hubei Province under Grant No. 2018CFB616.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Chen, Y., Qian, T., Zhong, M., Li, X. (2018). BASSI: Balance and Status Combined Signed Network Embedding. In: Pei, J., Manolopoulos, Y., Sadiq, S., Li, J. (eds) Database Systems for Advanced Applications. DASFAA 2018. Lecture Notes in Computer Science(), vol 10827. Springer, Cham. https://doi.org/10.1007/978-3-319-91452-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-91452-7_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-91451-0
Online ISBN: 978-3-319-91452-7
eBook Packages: Computer ScienceComputer Science (R0)