Inferring Attitude in Online Social Networks Based on Quadratic Correlation

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8443)


The structure of an online social network in most cases cannot be described just by links between its members. We study online social networks, in which members may have certain attitude, positive or negative, toward each other, and so the network consists of a mixture of both positive and negative relationships. Our goal is to predict the sign of a given relationship based on the evidences provided in the current snapshot of the network. More precisely, using machine learning techniques we develop a model that after being trained on a particular network predicts the sign of an unknown or hidden link. The model uses relationships and influences from peers as evidences for the guess, however, the set of peers used is not predefined but rather learned during the training process. We use quadratic correlation between peer members to train the predictor. The model is tested on popular online datasets such as Epinions, Slashdot, and Wikipedia. In many cases it shows almost perfect prediction accuracy. Moreover, our model can also be efficiently updated as the underlying social network evolves.


Signed Networks machine learning quadratic optimization 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    IBM ILOG CPLEX Optimizer (2010),
  2. 2.
  3. 3.
    Avesani, P., Massa, P., Tiella, R.: A trust-enhanced recommender system application: Moleskiing. In: SAC, pp. 1589–1593 (2005)Google Scholar
  4. 4.
    Brzozowski, M., Hogg, T., Szabó, G.: Friends and foes: ideological social networking. In: CHI, pp. 817–820 (2008)Google Scholar
  5. 5.
    Burke, M., Kraut, R.: Mopping up: modeling Wikipedia promotion decisions. In: CSCW, pp. 27–36 (2008)Google Scholar
  6. 6.
    Cartwright, D., Harary, F.: Structure balance: A generalization of Heider’s theory. Psychological Review 63(5), 277–293 (1956)CrossRefGoogle Scholar
  7. 7.
    Chiang, K.-Y., Natarajan, N., Tewari, A., Dhillon, I.: Exploiting longer cycles for link prediction in signed networks. In: CIKM, pp. 1157–1162 (2011)Google Scholar
  8. 8.
    Guha, R.V., Kumar, R., Raghavan, P., Tomkins, A.: Propagation of trust and distrust. In: WWW, pp. 403–412 (2004)Google Scholar
  9. 9.
    Guyon, I., Gunn, S., Nikravesh, M., Zadeh, L.A.: Feature extraction: foundations and applications. STUDFUZZ, vol. 207. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  10. 10.
    Harary, F.: On the notion of balance of a signed graph. Michigan Math. J. 2(2), 143–146 (1953)CrossRefMathSciNetGoogle Scholar
  11. 11.
    Al Hasan, M., Chaoji, V., Salem, S., Zaki, M.: Link prediction using supervised learning. In: SDM, 2006 Workshop on Link Analysis, Counterterrorism and Security (2006)Google Scholar
  12. 12.
    Kunegis, J., Lommatzsch, A., Bauckhage, C.: The Slashdot Zoo: mining a social network with negative edges. In: WWW 2009, pp. 741–750 (2009)Google Scholar
  13. 13.
    Lampe, C., Johnston, E., Resnick, P.: Follow the reader: filtering comments on Slashdot. In: CHI, pp. 1253–1262 (2007)Google Scholar
  14. 14.
    Leskovec, J., Huttenlocher, D.P., Kleinberg, J.M.: Predicting positive and negative links in online social networks. In: WWW, pp. 641–650 (2010)Google Scholar
  15. 15.
    Li, Y., Chen, W., Wang, Y., Zhang, Z.-L.: Influence diffusion dynamics and influence maximization in social networks with friend and foe relationships. In: WSDM 2013, pp. 657–666 (2013)Google Scholar
  16. 16.
    Liben-Nowell, D., Kleinberg, J.: The link prediction problem for social networks. In: CIKM 2003, pp. 556–559 (2003)Google Scholar
  17. 17.
    Liben-Nowell, D., Kleinberg, J.: The link-prediction problem for social networks. J. Am. Soc. Inf. Sci. Technol. 58(7), 1019–1031 (2007)CrossRefGoogle Scholar
  18. 18.
    Massa, P., Avesani, P.: Controversial users demand local trust metrics: An experimental study on community. In: AAAI, pp. 121–126 (2005)Google Scholar
  19. 19.
    McGeoch, C., Wang, C.: Experimental evaluation of an adiabiatic quantum system for combinatorial optimization. In: CF 2013, pp. 23:1–23:11 (2013)Google Scholar
  20. 20.
    Neven, H., Denchev, V., Rose, G., Macready, W.: Training a large scale classifier with the quantum adiabatic algorithm. CoRR, abs/0912.0779 (2009)Google Scholar
  21. 21.
    Newman, M.E.J.: The structure and function of complex networks. SIAM Review 45(2), 167–256 (2003)CrossRefzbMATHMathSciNetGoogle Scholar
  22. 22.
    Sarwar, B., Karypis, G., Konstan, J., Riedl, J.: Analysis of recommendation algorithms for e-commerce. In: ACM Conf. on Electronic Commerce, pp. 158–167 (2000)Google Scholar
  23. 23.
    Symeonidis, P., Tiakas, E., Manolopoulos, Y.: Transitive node similarity for link prediction in networks with positive and negative links. In: RecSys 2010, pp. 183–190 (2010)Google Scholar
  24. 24.
    Wang, C., Satuluri, V., Parthasarathy, S.: Local probabilistic models for link prediction. In: ICDM 2007, pp. 322–331 (2007)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.Simon Fraser University BurnabyCanada

Personalised recommendations