Skip to main content

Anchor Link Prediction Using Topological Information in Social Networks

  • Conference paper
  • First Online:
Web-Age Information Management (WAIM 2016)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9658))

Included in the following conference series:

Abstract

People today may participate in multiple social networks (Facebook, Twitter, Google+, etc.). Predicting the correspondence of the accounts that refer to the same natural person across multiple social networks is a significant and challenging problem. Formally, social networks that outline the relationships of a common group of people are defined as aligned networks, and the correspondence of the accounts that refer to the same natural person across aligned networks are defined as anchor links. In this paper, we learn the problem of Anchor Link Prediction (ALP). Firstly, two similarity metrics (Bi-Similarity BiS and Reliability Similarity ReS) are proposed to measure the similarity between nodes in aligned networks. And we prove mathematically that the node pair with the maximum BiS has higher probability to be an anchor link and a correctly predicted anchor link must have high ReS. Secondly, we present an iterative algorithm to solve the problem of ALP efficiently. Also, we discuss the termination of the algorithm to give a tradeoff between precision and recall. Finally, we conduct a series of experiments on both synthetic social networks and real social networks to confirm the effectiveness of our approach.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Vosecky, J., Hong, D., Shen, V.Y.: User identification across multiple social networks. In: 2009 First International Conference on Networked Digital Technologies, NDT 2009. IEEE (2009)

    Google Scholar 

  2. Raad, E., Chbeir, R., Dipanda, A.: User profile matching in social networks. In: 2010 13th International Conference on Network-Based Information Systems (NBiS), pp. 297–304. IEEE (2010)

    Google Scholar 

  3. Labitzke, S., Taranu, I., Hartenstein, H.: What your friends tell others about you: low cost linkability of social network profiles. In: Proceedings of 5th International ACM Workshop on Social Network Mining and Analysis, San Diego, CA, USA (2011)

    Google Scholar 

  4. Liu, S., Wang, S., Zhu, F., et al.: Hydra: large-scale social identity linkage via heterogeneous behavior modeling. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, pp. 51–62. ACM (2014)

    Google Scholar 

  5. Kong, X., Zhang, J., Yu, P.S.: Inferring anchor links across multiple heterogeneous social networks. In: Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, pp. 179–188. ACM (2013)

    Google Scholar 

  6. Yartseva, L., Grossglauser, M.: On the performance of percolation graph matching. In: Proceedings of the First ACM Conference on Online Social Networks, pp. 119–130. ACM (2013)

    Google Scholar 

  7. Korula, N., Lattanzi, S.: An efficient reconciliation algorithm for social networks. Proc. VLDB Endowment 7(5), 377–388 (2014)

    Article  Google Scholar 

  8. Kazemi, E., Hamed, S.H., Grossglauser, M.: Growing a graph matching from a handful of seeds. In: Proceedings of the VLDB Endowment International Conference on Very Large Data Bases, 8(EPFL-ARTICLE-207759) (2015)

    Google Scholar 

  9. Zhu, Y., Qin, L., Yu, J.X., et al.: High efficiency and quality: large graphs matching. VLDB J. Int. J. Very Large Data Bases 22(3), 345–368 (2013)

    Article  Google Scholar 

  10. Zafarani, R., Liu, H.: Connecting corresponding identities across communities. In: ICWSM (2009)

    Google Scholar 

  11. Narayanan, A., Shmatikov, V.: De-anonymizing social networks. In: 2009 30th IEEE Symposium on Security and Privacy, pp. 173–187. IEEE (2009)

    Google Scholar 

  12. Zafarani, R., Liu, H.: Connecting users across social media sites: a behavioral-modeling approach. In: Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 41–49. ACM (2013)

    Google Scholar 

  13. Bayati, M., Gerritsen, M., Gleich, D.F., et al.: Algorithms for large, sparse network alignment problems. In: 2009 Ninth IEEE International Conference on Data Mining, ICDM 2009, pp. 705–710. IEEE (2009)

    Google Scholar 

  14. Vesdapunt, N., Garcia-Molina, H.: Identifying Users in Social Networks with Limited Information (2014)

    Google Scholar 

  15. Barabási, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgment

This work is supported by the National Basic Research 973 Program of China under Grant No. 2012CB316201, the National Natural Science Foundation of China under Grant No. 61472070.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Derong Shen .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Feng, S., Shen, D., Kou, Y., Nie, T., Yu, G. (2016). Anchor Link Prediction Using Topological Information in Social Networks. In: Cui, B., Zhang, N., Xu, J., Lian, X., Liu, D. (eds) Web-Age Information Management. WAIM 2016. Lecture Notes in Computer Science(), vol 9658. Springer, Cham. https://doi.org/10.1007/978-3-319-39937-9_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-39937-9_26

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-39936-2

  • Online ISBN: 978-3-319-39937-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics