Skip to main content

Hybrid Approach for Predicting and Recommending Links in Social Networks

  • Conference paper
  • First Online:
Computational Intelligence: Theories, Applications and Future Directions - Volume II

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 799))

Abstract

The prevalence of social networks like Myspace, Facebook, Hi5, and LinkedIn is increasing day by day, as they provide a platform where users of the social network can share their content. They also facilitate their users by recommending new friends on the basis of local or global network features. Local feature-based approaches do not exploit the whole network structure. In contrary to the techniques based on local features, global feature-based techniques make use of the complete network structure, being less efficient for large social networks. Here, we define a hybrid feature-based approach that uses local graph feature by computing proximity between every pair of nodes. It also captures global feature by computing all length two and length three pathways between each pair of vertices of the network. We performed experimental evaluation by comparing the proposed approach with other friend recommendation techniques. The experimental results indicate that our algorithm provides adequate level of efficiency as well as accuracy in friend recommendations.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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

References

  1. Travers, J., Milgram, S.: The small world problem. Psychol. Today 1, 61–67 (1967)

    Google Scholar 

  2. Bisgin, H., Agarwal, N., Xu, X.: A study of homophily on social media. World Wide Web 15(2), 213–232 (2012)

    Article  Google Scholar 

  3. Goel, S., Muhamad, R., Watts, D: Social search in small-world experiments. In Proceedings of the 18th international conference on World Wide Web, pp. 701–710. ACM (April 2009)

    Google Scholar 

  4. Liben-Nowell, D., Kleinberg, J.: The link-prediction problem for social networks. J. Assoc. Inf. Sci. Technol. 58(7), 1019–1031 (2007)

    Article  Google Scholar 

  5. Adamic, L., Adar, E.: How to search a social network. Soc. Netw. 27(3), 187–203 (2005)

    Article  Google Scholar 

  6. Chen, J., Geyer, W., Dugan, C., Muller, M., Guy, I.: Make new friends, but keep the old: recommending people on social networking sites. In Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, pp. 201–210. ACM (April 2009)

    Google Scholar 

  7. Thomas H..Cormen, Leiserson, C. E., Rivest, R. L., Stein, C.: Introduction to algorithms (Vol. 6). Cambridge: MIT press (2001)

    Google Scholar 

  8. Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM (JACM) 34(3), 596–615 (1987)

    Article  MathSciNet  Google Scholar 

  9. Pan, J. Y., Yang, H. J., Faloutsos, C., Duygulu, P.: Automatic multimedia cross-modal correlation discovery. In Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 653–658. ACM (August 2004)

    Google Scholar 

  10. Jeh, G., Widom, J.: SimRank: a measure of structural-context similarity. In Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 538–543. ACM (July 2002)

    Google Scholar 

  11. Yu, W., Lin, X., Le, J.: A space and time efficient algorithm for SimRank computation. In: 2010 12th International Asia-Pacific on Web Conference (APWEB), pp. 164–170. IEEE (April 2010)

    Google Scholar 

  12. Papadimitriou, A., Symeonidis, P., Manolopoulos, Y.: Fast and accurate link prediction in social networking systems. J. Syst. Softw. 85(9), 2119–2132 (2012)

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  16. Zachary, W.W.: An information flow model for conflict and fission in small groups. J. Anthropol. Res. 33(4), 452–473 (1977)

    Article  Google Scholar 

  17. Gleiser, P.M., Danon, L.: Community structure in jazz. Adv. Complex Syst. 6(04), 565–573 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Abhay Kumar Rai .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Tripathi, S.P., Yadav, R.K., Rai, A.K., Tewari, R.R. (2019). Hybrid Approach for Predicting and Recommending Links in Social Networks. In: Verma, N., Ghosh, A. (eds) Computational Intelligence: Theories, Applications and Future Directions - Volume II. Advances in Intelligent Systems and Computing, vol 799. Springer, Singapore. https://doi.org/10.1007/978-981-13-1135-2_9

Download citation

Publish with us

Policies and ethics