Skip to main content

A Feature-Based Approach for the Redefined Link Prediction Problem in Signed Networks

  • Conference paper
  • First Online:
Advanced Data Mining and Applications (ADMA 2017)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 10604))

Included in the following conference series:

Abstract

Link prediction is an important research issue in social networks, which can be applied in many areas, such as trust-aware business applications and viral marketing campaigns. With the rise of signed networks, the link prediction problem becomes more complex and challenging as it introduces negative relations among users. Instead of predicting future relation for a pair of users, however, the current research focuses on distinguishing whether a certain link is positive or negative, on the premise of the link existence. The situation that two users do not have relation (i.e., no-relation) is also not considered, which actually is the most common case in reality. In this paper, we redefine the link prediction problem in signed social networks by also considering “no-relation” as a future status of a node pair. To understand the underlying mechanism of link formation in signed networks, we propose a feature framework on the basis of a thorough exploration of potential features for the newly identified problem. We find that features derived from social theories can well distinguish these three social statuses. Grounded on the feature framework, we adopt a multiclass classification model to leverage all the features, and experiments show that our method outperforms the state-of-the-art methods.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    The preliminary version [10] of our work has been published at AAAI 2017 as a student abstract.

  2. 2.

    https://snap.stanford.edu.

References

  1. Adamic, L.A., Adar, E.: Friends and neighbors on the web. Soc. Netw. 25(3), 211–230 (2003)

    Article  Google Scholar 

  2. Al Hasan, M., Chaoji, V., Salem, S., Zaki, M.: Link prediction using supervised learning. In: SDM (2006)

    Google Scholar 

  3. Antal, T., Krapivsky, P.L., Redner, S.: Social balance on networks: the dynamics of friendship and enmity. Phys. D Nonlinear Phenom. 224(1), 130–136 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  4. Chiang, K.Y., Natarajan, N., Tewari, A., Dhillon, I.S.: Exploiting longer cycles for link prediction in signed networks. In: CIKM, pp. 1157–1162. ACM (2011)

    Google Scholar 

  5. Davis, J.A., Leinhardt, S.: The structure of positive interpersonal relations in small groups (1967)

    Google Scholar 

  6. Falk, A., Fischbacher, U.: A theory of reciprocity. Games Econ. Behav. 54(2), 293–315 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  7. Hsieh, C.J., Chiang, K.Y., Dhillon, I.S.: Low rank modeling of signed networks. In: SIGKDD, pp. 507–515. ACM (2012)

    Google Scholar 

  8. Katz, L.: A new status index derived from sociometric analysis. Psychometrika 18(1), 39–43 (1953)

    Article  MATH  Google Scholar 

  9. Leskovec, J., Huttenlocher, D., Kleinberg, J.: Predicting positive and negative links in online social networks. In: WWW, pp. 641–650. ACM (2010)

    Google Scholar 

  10. Li, X., Fang, H., Zhang, J.: Rethinking the link prediction problem in signed social networks. In: AAAI (2017)

    Google Scholar 

  11. Liben-Nowell, D., Kleinberg, J.: The link-prediction problem for social networks. JAIST 58(7), 1019–1031 (2007)

    Google Scholar 

  12. Lichtenwalter, R.N., Chawla, N.V.: Vertex collocation profiles: subgraph counting for link analysis and prediction. In: WWW, pp. 1019–1028. ACM (2012)

    Google Scholar 

  13. Lichtenwalter, R.N., Lussier, J.T., Chawla, N.V.: New perspectives and methods in link prediction. In: SIGKDD, pp. 243–252. ACM (2010)

    Google Scholar 

  14. Lü, L., Zhou, T.: Link prediction in complex networks: a survey. Phys. A Stat. Mech. Appl. 390(6), 1150–1170 (2011)

    Article  Google Scholar 

  15. Menon, A.K., Elkan, C.: Link Prediction via Matrix Factorization. In: Gunopulos, D., Hofmann, T., Malerba, D., Vazirgiannis, M. (eds.) ECML PKDD 2011. LNCS, vol. 6912, pp. 437–452. Springer, Heidelberg (2011). doi:10.1007/978-3-642-23783-6_28

    Chapter  Google Scholar 

  16. Newman, M.E.: Clustering and preferential attachment in growing networks. Phys. Rev. E 64(2), 025102 (2001)

    Article  Google Scholar 

  17. Papaoikonomou, A., Kardara, M., Tserpes, K., Varvarigou, T.A.: Predicting edge signs in social networks using frequent subgraph discovery. IEEE Internet Comput. 18(5), 36–43 (2014)

    Article  Google Scholar 

  18. Song, D., Meyer, D.A.: Recommending positive links in signed social networks by optimizing a generalized auc. In: AAAI, pp. 290–296 (2015)

    Google Scholar 

  19. Symeonidis, P., Tiakas, E.: Transitive node similarity: predicting and recommending links in signed social networks. WWW 17(4), 743–776 (2014)

    Article  Google Scholar 

  20. Tang, J., Chang, Y., Liu, H.: Mining social media with social theories: a survey. ACM SIGKDD Explor. Newsl. 15(2), 20–29 (2014)

    Article  Google Scholar 

  21. Tufekci, Z.: Who acquires friends through social media and why? “rich get richer” versus “seek and ye shall find”. In: ICWSM (2010)

    Google Scholar 

  22. Zhang, J., Lv, Y., Yu, P.: Enterprise social link recommendation. In: CIKM, pp. 841–850. ACM (2015)

    Google Scholar 

  23. Zhao, T., Zhao, H.V., King, I.: Exploiting game theoretic analysis for link recommendation in social networks. In: CIKM, pp. 851–860. ACM (2015)

    Google Scholar 

  24. Zhou, T., Lü, L., Zhang, Y.C.: Predicting missing links via local information. EPLB-Condens. Matter Complex Syst. 71(4), 623–630 (2009)

    Article  MATH  Google Scholar 

Download references

Acknowledgement

This work was supported by the National Natural Science Foundation of China (Grant No. 71601104).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hui Fang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Li, X., Fang, H., Zhang, J. (2017). A Feature-Based Approach for the Redefined Link Prediction Problem in Signed Networks. In: Cong, G., Peng, WC., Zhang, W., Li, C., Sun, A. (eds) Advanced Data Mining and Applications. ADMA 2017. Lecture Notes in Computer Science(), vol 10604. Springer, Cham. https://doi.org/10.1007/978-3-319-69179-4_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-69179-4_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-69178-7

  • Online ISBN: 978-3-319-69179-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics