Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

An Account Matching Method Based on Hyper Graph

  • Conference paper
  • First Online:
Information Security and Privacy (ACISP 2024)

Abstract

Character attribute recognition refers to the process of extracting character features and applying machine learning, deep learning and other technical means to recognize character attributes such as position, work unit, field of study, etc., by using data such as text and social relations in multi-source networks, which plays an important role in the fields of character profiling and user recommendation. In this paper, for the problems of strong sparsity of single-source networks in the Internet and insufficient ability to characterize character attributes in text, we propose a hyper graph-based account matching method from constructing multi-source network data associations, which achieves the characterization learning of multiple social network data in the same embedding space, avoids the noise introduced by the existing graph characterization methods based on the topology, and then utilizes the user profile similarity and node proximity of cross-social networks to identify character attributes. profile similarity and node proximity information across social networks to train an unsupervised matching model, which realizes the integration of multi-source network character attributes by matching account information from multiple social networks. Experiments show that this method greatly improves the accuracy of account matching and effectively establishes the connection between multi-source social network data.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.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. Donnat, C., Zitnik, M., Hallac, D., Leskovec, J.: Learning structural node embeddings via diffusion wavelets. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 1320–1329. KDD ’18, Association for Computing Machinery, New York, NY, USA (2018). https://doi.org/10.1145/3219819.3220025

  2. Glorot, X., Bengio, Y.: Understanding the difficulty of training deep feedforward neural networks. In: Teh, Y.W., Titterington, M. (eds.) Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics. Proceedings of Machine Learning Research, vol. 9, pp. 249–256. PMLR, Chia Laguna Resort, Sardinia, Italy (2010). https://proceedings.mlr.press/v9/glorot10a.html

  3. Grover, A., Leskovec, J.: node2vec: scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 855–864. KDD ’16, Association for Computing Machinery, New York, NY, USA (2016). https://doi.org/10.1145/2939672.2939754

  4. Huang, X., Li, J., Hu, X.: Label informed attributed network embedding. In: Proceedings of the Tenth ACM International Conference on Web Search and Data Mining, pp. 731–739. WSDM ’17, Association for Computing Machinery, New York, NY, USA (2017). https://doi.org/10.1145/3018661.3018667

  5. Kumar, V., Pujari, A.K., Padmanabhan, V., Sahu, S.K., Kagita, V.R.: Multilabel classification using hierarchical embedding. Expert Syst. Appl. 91, 263–269 (2018). https://doi.org/10.1016/j.eswa.2017.09.020, https://www.sciencedirect.com/science/article/pii/S0957417417306309

  6. Liu, L., Cheung, W.K., Li, X., Liao, L.: Aligning users across social networks using network embedding. In: IJCAI, vol. 16, pp. 1774–1780 (2016)

    Google Scholar 

  7. Malhotra, A., Totti, L., Meira Jr., W., Kumaraguru, P., Almeida, V.: Studying user footprints in different online social networks. In: 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, pp. 1065–1070 (2012). https://doi.org/10.1109/ASONAM.2012.184

  8. Motoyama, M., Varghese, G.: I seek you: searching and matching individuals in social networks. In: Proceedings of the Eleventh International Workshop on Web Information and Data Management, pp. 67–75. WIDM ’09, Association for Computing Machinery, New York, NY, USA (2009). https://doi.org/10.1145/1651587.1651604

  9. Narayanan, A., Shmatikov, V.: De-anonymizing social networks. In: 2009 30th IEEE Symposium on Security and Privacy. pp. 173–187 (2009). https://doi.org/10.1109/SP.2009.22

  10. Tan, S., Guan, Z., Cai, D., Qin, X., Bu, J., Chen, C.: Mapping users across networks by manifold alignment on hypergraph. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 28, issue 1 (2014). https://doi.org/10.1609/aaai.v28i1.8720, https://ojs.aaai.org/index.php/AAAI/article/view/8720

  11. Trung, H.T., et al.: A comparative study on network alignment techniques. Expert Syst. Appl. 140, 112883 (2020). https://doi.org/10.1016/j.eswa.2019.112883, https://www.sciencedirect.com/science/article/pii/S0957417419305937

  12. Wan, Y., Chen, X., Zhang, J.: Global and intrinsic geometric structure embedding for unsupervised feature selection. Expert Syst. Appl. 93, 134–142 (2018). https://doi.org/10.1016/j.eswa.2017.10.008, https://www.sciencedirect.com/science/article/pii/S0957417417306826

  13. Wu, S.H., Chien, H.H., Lin, K.H., Yu, P.: Learning the consistent behavior of common users for target node prediction across social networks. In: Xing, E.P., Jebara, T. (eds.) Proceedings of the 31st International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 32, pp. 298–306. PMLR, Bejing, China (2014). https://proceedings.mlr.press/v32/wu14.html

  14. Wu, Z., Pan, S., Chen, F., Long, G., Zhang, C., Yu, P.S.: A comprehensive survey on graph neural networks. IEEE Trans. Neural Netw. Learn. Syst. 32(1), 4–24 (2021). https://doi.org/10.1109/TNNLS.2020.2978386

    Article  MathSciNet  Google Scholar 

  15. Zhang, J., Philip, S.Y.: Integrated anchor and social link predictions across social networks. In: Twenty-Fourth International Joint Conference on Artificial Intelligence (2015)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xuemeng Zhai .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Tang, Z. et al. (2024). An Account Matching Method Based on Hyper Graph. In: Zhu, T., Li, Y. (eds) Information Security and Privacy. ACISP 2024. Lecture Notes in Computer Science, vol 14896. Springer, Singapore. https://doi.org/10.1007/978-981-97-5028-3_22

Download citation

  • DOI: https://doi.org/10.1007/978-981-97-5028-3_22

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-97-5027-6

  • Online ISBN: 978-981-97-5028-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics