Skip to main content

User Linkage Across Anonymizd Social Networks

  • Conference paper
  • First Online:
  • 1746 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11280))

Abstract

Nowadays, the user linkage or link prediction task is usually based on user profile or some sensitive data (i.e., name, gender, ID, life or health insurance accounts, etc.). With the enhancement of laws and regulations, the difficulty of personal sensitive data acquisition is increasing. Moreover, the abnormal users called online water army often camouflage themselves to achieve specific goals. They often register false user information such as name, gender, age, etc. To protect privacy and satisfy the needs of camouflage, users and ISPs often hide those sensitive data (i.e., user profile). In this paper, we want to link same user in multiple social networks, which is formally defined as ULASN (User Linkage across Anonymized Social Networks) problem. ULASN is very challenging to address due to (1) the lack of enough ground-truth to build models and obtain accurate prediction results, (2) the studied networks are anonymized, where no user profile or sensitive data is available, and (3) the need of scalable algorithms for user linkage task in large-scale social nateworks, and (4) users in social network are interrelated. To resolve these challenges, a noval user linkage framework based on social structures called ULA is proposed in this paper. ULA tackles these problems by considering massive, low-quality and interrelated user information. It uses few ground-truth to partition users into blocks, which reduces the size of candidates. By extending Fellegi-Sunter methods, our proposed algorithm can handle social network similarity complying to continuous distributions. A probabilistic generative model is proposed and solved by EM algorithm. Simultaneously, missing value problem can also solved when we use EM algorithm to learning parameters. Extensive experiments conducted on two real-world social networks demonstrate that ULA can perform very well in solving ULASN problem.

This work is supported by the Initial Scientific Research Foud of Introduced Talents in Anhui Polytechnic University (No. 2017YQQ015) and Natural Science Foundation of Anhui Province (No. 1608085MF147).

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

Buying options

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

Learn about institutional subscriptions

References

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

    Google Scholar 

  2. Newcombe, H.B., et al.: Automatic linkage of vital records. Science 130(3381), 954–959 (1959)

    Article  Google Scholar 

  3. Wang, H., et al.: Nodes evolution diversity and link prediction in social networks. IEEE Trans. Knowl. Data Eng. 29(10), 2263–2274 (2017)

    Article  Google Scholar 

  4. Wu, L., et al.: Modeling the evolution of users’ preferences and social links in social networking services. IEEE Trans. Knowl. Data Eng. 29(6), 1240–1253 (2017)

    Article  Google Scholar 

  5. Zhu, L., et al.: Scalable temporal latent space inference for link prediction in dynamic social networks. IEEE Trans. Knowl. Data Eng. 28(10), 2765–2777 (2016)

    Article  Google Scholar 

  6. Ermi, B., Acar, E., Cemgil, A.T.: Link prediction in heterogeneous data via generalized coupled tensor factorization. Data Min. Knowl. Discov. 29(1), 203–236 (2015)

    Article  MathSciNet  Google Scholar 

  7. Zhao, L., et al.: Protein complexes prediction via positive and unlabeled learning of the PPI networks. In: Proceedings of International Conference on Service Systems and Service Management, pp. 1–6. IEEE, Kunming (2016)

    Google Scholar 

  8. Yang, Y., Lichtenwalter, R.N., Chawla, N.V.: Evaluating link prediction methods. Knowl. Inf. Syst. 45(3), 751–782 (2015)

    Article  Google Scholar 

  9. Kaya, B., Poyraz, M.: Finding relations between diseases by age-series based supervised link prediction. In: Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, pp. 1097–1103. ACM/IEEE, Paris (2016)

    Google Scholar 

  10. Kaya, B., Poyraz, M.: Unsupervised link prediction in evolving abnormal medical parameter networks. Int. J. Mach. Learn. Cybern. 7(1), 145–155 (2016)

    Article  Google Scholar 

  11. Chuan, P.M., et al.: Link prediction in co-authorship networks based on hybrid content similarity metric. Appl. Intell. 2017(3), 1–17 (2017)

    Google Scholar 

  12. Berlusconi, G, et al.: Link prediction in criminal networks: a tool for criminal intelligence analysis. Plos One 11(4) (2016). https://doi.org/10.1371/journal.pone.0154244

    Article  Google Scholar 

  13. Nayak, S.C., Misra, B.B., Behera, H.S.: ACFLN: artificial chemical functional link network for prediction of stock market index. Evol. Syst. 2018(4), 1–26 (2018)

    Google Scholar 

  14. Martnez, V., Berzal, F., Cubero, F.: A survey of link prediction in complex networks. ACM Comput. Surv. 49(4), 69 (2016)

    Google Scholar 

  15. Fu, C., Zhao, M., Fan, L., et al.: Link weight prediction using supervised learning methods and its application to Yelp layered network. IEEE Trans. Knowl. Data Eng. 30(8), 1507–1518 (2018)

    Article  Google Scholar 

  16. De, A., et al.: Discriminative link prediction using local, community, and global signals. IEEE Trans. Knowl. Data Eng. 28(8), 2057–2070 (2016)

    Article  Google Scholar 

  17. Lichtenwalter, R.N., Lussier, J.T., Chawla, N.V.: New perspectives and methods in link prediction. In: Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 243–252. ACM, Washington, DC (2010)

    Google Scholar 

  18. Liu, J., Deng, G.: Link prediction in a userobject network based on time-weighted resource allocation. Phys. A Stat. Mech. Appl. 388(17), 3643–3650 (2009)

    Article  Google Scholar 

  19. Wu, J.H., et al.: Weighted local naive Bayes link prediction. J. Inf. Process. Syst. 13(4), 914–927 (2017)

    Google Scholar 

  20. Chen, H., et al.: Scaling up Markov logic probabilistic inference for social graphs. IEEE Trans. Knowl. Data Eng. 29(2), 433–445 (2017)

    Article  Google Scholar 

  21. Liao, L., et al.: Attributed social network embedding. IEEE Trans. Knowl. Data Eng. (2017). https://doi.org/10.1109/TKDE.2018.2819980

    Article  Google Scholar 

  22. Ozcan, A., Oguducu, S.G.: Link prediction in evolving heterogeneous networks using the NARX neural networks. Knowl. Inf. Syst. 2017(3), 1–28 (2017)

    Google Scholar 

  23. Chen, K., et al.: A time-aware link prediction approach based on semi-supervised learning. J. Comput. Inf. Syst. 10(11), 4593–4600 (2014)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chao Kong .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kong, C., Tao, W., Liu, S., Zhang, Q. (2018). User Linkage Across Anonymizd Social Networks. In: Chen, X., Sen, A., Li, W., Thai, M. (eds) Computational Data and Social Networks. CSoNet 2018. Lecture Notes in Computer Science(), vol 11280. Springer, Cham. https://doi.org/10.1007/978-3-030-04648-4_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-04648-4_16

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-04647-7

  • Online ISBN: 978-3-030-04648-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics