Skip to main content
Erschienen in: Social Network Analysis and Mining 1/2021

01.12.2021 | Original Article

Identifying multiple social network accounts belonging to the same users

verfasst von: Ahmet Anıl Müngen, Esra Gündoğan, Mehmet Kaya

Erschienen in: Social Network Analysis and Mining | Ausgabe 1/2021

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Social networks used for different purposes by users contain different user data. Finding same users' accounts in different social networks and compiling the data found in a single repository will be a very important factor that will both improve the recommended systems and increase the user experience. The aim of this study is to collect the data of thousands of users in nine different social networks and to find the same users in these networks. For this purpose, the novel node alignment and node similarity methods were proposed in the study. While using the anchor method for topological-based node proposition, density relationships between connections are also taken into account. In the node similarity method, the number of successful node matching was increased with attribute selection criteria and initial state selection method we proposed. However, in this study, alignment and similarity were determined both according to users’ profile characteristics and their relationship with other users. Nine different methods have been proposed for finding the same accounts on different social networks. The proposed methods were tested on the data of two to six social networks, and users' match success rates were measured. The results showed success rates of up to 95%. This enabled the creation of a wide user profile covering multiple social networks for users whose different attributes are gathered on the same graph in multiple social networks.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literatur
Zurück zum Zitat Adamic L, Adar E (2005) How to search a social network. Soc Netw 27(3):187–203CrossRef Adamic L, Adar E (2005) How to search a social network. Soc Netw 27(3):187–203CrossRef
Zurück zum Zitat Aslan S, Kaya M (2018) Topic recommendation for authors as a link prediction problem. Futur Gener Comput Syst 89:249–264CrossRef Aslan S, Kaya M (2018) Topic recommendation for authors as a link prediction problem. Futur Gener Comput Syst 89:249–264CrossRef
Zurück zum Zitat Bag S, Kumar SK, Tiwari MK (2019) An efficient recommendation generation using relevant Jaccard similarity. Inf Sci 483:53–64CrossRef Bag S, Kumar SK, Tiwari MK (2019) An efficient recommendation generation using relevant Jaccard similarity. Inf Sci 483:53–64CrossRef
Zurück zum Zitat Berlingerio M, Koutra D, Eliassi-Rad T, Faloutsos C (2012) Netsimile: a scalable approach to size-independent network similarity. arXiv:1209.2684 Berlingerio M, Koutra D, Eliassi-Rad T, Faloutsos C (2012) Netsimile: a scalable approach to size-independent network similarity. arXiv:​1209.​2684
Zurück zum Zitat Bródka P (2016) A method for group extraction and analysis in multilayer social networks. PhD Thesis, Wroclaw University of Technology Bródka P (2016) A method for group extraction and analysis in multilayer social networks. PhD Thesis, Wroclaw University of Technology
Zurück zum Zitat Bütün E, Kaya M (2019) A pattern based supervised link prediction in directed complex networks. Physica A 525:1136–1145CrossRef Bütün E, Kaya M (2019) A pattern based supervised link prediction in directed complex networks. Physica A 525:1136–1145CrossRef
Zurück zum Zitat Bütün E, Kaya M (2020) Predicting citation count of scientists as a link prediction problem. IEEE Transact Cybern 50(10):4518–4529CrossRef Bütün E, Kaya M (2020) Predicting citation count of scientists as a link prediction problem. IEEE Transact Cybern 50(10):4518–4529CrossRef
Zurück zum Zitat Bütün E, Kaya M, Alhajj R (2018) Extension of neighbor-based link prediction methods for directed, weighted and temporal social networks. Inf Sci 463:152–165MathSciNetCrossRef Bütün E, Kaya M, Alhajj R (2018) Extension of neighbor-based link prediction methods for directed, weighted and temporal social networks. Inf Sci 463:152–165MathSciNetCrossRef
Zurück zum Zitat Cai B, Wang H, Zheng H, Wang H (2011) An improved random walk based clustering algorithm for community detection in complex networks. Paper presented at IEEE international conference on systems, man, and cybernetics. pp. 2162–21 Cai B, Wang H, Zheng H, Wang H (2011) An improved random walk based clustering algorithm for community detection in complex networks. Paper presented at IEEE international conference on systems, man, and cybernetics. pp. 2162–21
Zurück zum Zitat Deng K, Xing L, Zheng L, Wu H, Xie P, Gao F (2019) A user identification algorithm based on user behavior analysis in social networks. IEEE Access 7:47114–47123CrossRef Deng K, Xing L, Zheng L, Wu H, Xie P, Gao F (2019) A user identification algorithm based on user behavior analysis in social networks. IEEE Access 7:47114–47123CrossRef
Zurück zum Zitat Dong Y, et al. (2012) Link prediction and recommendation across heterogeneous social networks. Paper presented at IEEE 12th International conference on data mining. pp. 181–190 Dong Y, et al. (2012) Link prediction and recommendation across heterogeneous social networks. Paper presented at IEEE 12th International conference on data mining. pp. 181–190
Zurück zum Zitat Donnat C, Zitnik M, Hallac D, Leskovec J (2018) Learning structural node embeddings via diffusion wavelets. In: Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining, pp 1320–1329 Donnat C, Zitnik M, Hallac D, Leskovec J (2018) Learning structural node embeddings via diffusion wavelets. In: Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining, pp 1320–1329
Zurück zum Zitat Faisal FE, Zhao H, Milenković T (2014) Global network alignment in the context of aging. IEEE/ACM Trans Comput Biol Bioinf 12(1):40–52CrossRef Faisal FE, Zhao H, Milenković T (2014) Global network alignment in the context of aging. IEEE/ACM Trans Comput Biol Bioinf 12(1):40–52CrossRef
Zurück zum Zitat Fishkind DE, Adali S, Patsolic HG, Meng L, Singh D, Lyzinski V, Priebe CE (2019) Seeded graph matching. Pattern Recogn 87:203–215CrossRef Fishkind DE, Adali S, Patsolic HG, Meng L, Singh D, Lyzinski V, Priebe CE (2019) Seeded graph matching. Pattern Recogn 87:203–215CrossRef
Zurück zum Zitat Fouss F, Pirotte A, Renders JM, Saerens M (2007) Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. IEEE Trans Knowl Data Eng 19(3):355–369CrossRef Fouss F, Pirotte A, Renders JM, Saerens M (2007) Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. IEEE Trans Knowl Data Eng 19(3):355–369CrossRef
Zurück zum Zitat Jeh G, Widom J (2002) 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 Jeh G, Widom J (2002) 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
Zurück zum Zitat Kasbekar P, Potika K, Pollett C (2020) Find me if you can: aligning users in different social networks. Paper presented at IEEE sixth international conference on big data computing service and applications (big data service). pp. 46–53 Kasbekar P, Potika K, Pollett C (2020) Find me if you can: aligning users in different social networks. Paper presented at IEEE sixth international conference on big data computing service and applications (big data service). pp. 46–53
Zurück zum Zitat Kleinberg J (2000) The small-world phenomenon: an algorithmic perspective. In Proceedings of the thirty-second annual ACM symposium on Theory of computing. pp. 163–170 Kleinberg J (2000) The small-world phenomenon: an algorithmic perspective. In Proceedings of the thirty-second annual ACM symposium on Theory of computing. pp. 163–170
Zurück zum Zitat Koutra D, Tong H, Lubensky D (2013) Big-align: fast bipartite graph alignment. In: 2013 IEEE 13th international conference on data mining, pp 389–398 Koutra D, Tong H, Lubensky D (2013) Big-align: fast bipartite graph alignment. In: 2013 IEEE 13th international conference on data mining, pp 389–398
Zurück zum Zitat Koutra D, Parikh A, Ramdas A, Xiang J (2016) Algorithms for graph similarity and subgraph matching. Phys Rev Lett Koutra D, Parikh A, Ramdas A, Xiang J (2016) Algorithms for graph similarity and subgraph matching. Phys Rev Lett
Zurück zum Zitat Kuchaiev O, Pržulj N (2011) Integrative network alignment reveals large regions of global network similarity in yeast and human. Bioinformatics 27(10):1390–1396CrossRef Kuchaiev O, Pržulj N (2011) Integrative network alignment reveals large regions of global network similarity in yeast and human. Bioinformatics 27(10):1390–1396CrossRef
Zurück zum Zitat Lacoste-Julien S, Palla K, Davies A, Kasneci G, Graepel T, Ghahramani Z (2013) Sigma: simple greedy matching for aligning large knowledge bases. In: Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining. pp. 572–580 Lacoste-Julien S, Palla K, Davies A, Kasneci G, Graepel T, Ghahramani Z (2013) Sigma: simple greedy matching for aligning large knowledge bases. In: Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining. pp. 572–580
Zurück zum Zitat Le DH (2017) Random walk with restart: a powerful network propagation algorithm in bioinformatics field. Paper presented at 4th NAFOSTED conference on information and computer science. pp. 242–247 Le DH (2017) Random walk with restart: a powerful network propagation algorithm in bioinformatics field. Paper presented at 4th NAFOSTED conference on information and computer science. pp. 242–247
Zurück zum Zitat Li Y, Su Z, Yang J, Gao C (2020) Exploiting similarities of user friendship networks across social networks for user identification. Inf Sci 506:78–98CrossRef Li Y, Su Z, Yang J, Gao C (2020) Exploiting similarities of user friendship networks across social networks for user identification. Inf Sci 506:78–98CrossRef
Zurück zum Zitat Liben-Nowell D, Kleinberg J (2007) The link-prediction problem for social networks. J Am Soc Inform Sci Technol 58(7):1019–1031CrossRef Liben-Nowell D, Kleinberg J (2007) The link-prediction problem for social networks. J Am Soc Inform Sci Technol 58(7):1019–1031CrossRef
Zurück zum Zitat Liu S, Wang S, Zhu F, Zhang J, Krishnan R (2014) 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 Liu S, Wang S, Zhu F, Zhang J, Krishnan R (2014) 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
Zurück zum Zitat Liu L, Cheung WK, Li X, Liao L (2016) Aligning users across social networks using network embedding. In Ijcai (pp. 1774–1780). Liu L, Cheung WK, Li X, Liao L (2016) Aligning users across social networks using network embedding. In Ijcai (pp. 1774–1780).
Zurück zum Zitat Peyer S, S., Rautenbach, D., & Vygen, J. (2009) A generalization of Dijkstra’s shortest path algorithm with applications to VLSI routing. J Discret Algorithms 7(4):377–390MathSciNetCrossRef Peyer S, S., Rautenbach, D., & Vygen, J. (2009) A generalization of Dijkstra’s shortest path algorithm with applications to VLSI routing. J Discret Algorithms 7(4):377–390MathSciNetCrossRef
Zurück zum Zitat Rahman MM (2012) Intellectual knowledge extraction from online social data. Paper presented at 2012 international conference on informatics, electronics & vision (ICIEV). pp. 205–210 Rahman MM (2012) Intellectual knowledge extraction from online social data. Paper presented at 2012 international conference on informatics, electronics & vision (ICIEV). pp. 205–210
Zurück zum Zitat Sun Y, Crawford J, Tang J, Milenković T (2015) Simultaneous optimization of both node and edge conservation in network alignment via WAVE. In: Pop M, Touzet H (eds) International workshop on algorithms in bioinformatics. Springer, Berlin, Heidelberg, pp 16–39CrossRef Sun Y, Crawford J, Tang J, Milenković T (2015) Simultaneous optimization of both node and edge conservation in network alignment via WAVE. In: Pop M, Touzet H (eds) International workshop on algorithms in bioinformatics. Springer, Berlin, Heidelberg, pp 16–39CrossRef
Zurück zum Zitat Symeonidis P, Tiakas E (2014) Transitive node similarity: predicting and recommending links in signed social networks. World Wide Web 17(4):743–776CrossRef Symeonidis P, Tiakas E (2014) Transitive node similarity: predicting and recommending links in signed social networks. World Wide Web 17(4):743–776CrossRef
Zurück zum Zitat Tan S, Guan Z, Cai D, Qin X, Bu J, Chen C (2014) Mapping users across networks by manifold alignment on hypergraph. Paper presented at twenty-eighth AAAI conference on artificial intelligence Tan S, Guan Z, Cai D, Qin X, Bu J, Chen C (2014) Mapping users across networks by manifold alignment on hypergraph. Paper presented at twenty-eighth AAAI conference on artificial intelligence
Zurück zum Zitat Wang M, Tan Q, Wang X, Shi J (2018) De-anonymizing social networks user via profile similarity. In 2018 IEEE Third International Conference on Data Science in Cyberspace (DSC) (pp. 889–895). IEEE. Wang M, Tan Q, Wang X, Shi J (2018) De-anonymizing social networks user via profile similarity. In 2018 IEEE Third International Conference on Data Science in Cyberspace (DSC) (pp. 889–895). IEEE.
Zurück zum Zitat Wang, H., Zhou, B., Huang, J., Liu, Y., Zheng, X., & Han, W. (2019). BICON: Connecting the Same Users of Different Social Networks using BiLSTM. In 2019 IEEE Fourth International Conference on Data Science in Cyberspace (DSC) (pp. 432–438). IEEE. Wang, H., Zhou, B., Huang, J., Liu, Y., Zheng, X., & Han, W. (2019). BICON: Connecting the Same Users of Different Social Networks using BiLSTM. In 2019 IEEE Fourth International Conference on Data Science in Cyberspace (DSC) (pp. 432–438). IEEE.
Zurück zum Zitat Wu, S. H., Chien, H. H., Lin, K. H., & Yu, P. (2014). Learning the consistent behavior of common users for target node prediction across social networks. In International Conference on Machine Learning (pp. 298–306). Wu, S. H., Chien, H. H., Lin, K. H., & Yu, P. (2014). Learning the consistent behavior of common users for target node prediction across social networks. In International Conference on Machine Learning (pp. 298–306).
Zurück zum Zitat Yang J, Zhang XD (2016) Predicting missing links in complex networks based on common neighbors and distance. Scientific reports 6:38208CrossRef Yang J, Zhang XD (2016) Predicting missing links in complex networks based on common neighbors and distance. Scientific reports 6:38208CrossRef
Zurück zum Zitat Zhang J, Philip SY (2015) June). Integrated anchor and social link predictions across social networks, In Twenty-fourth international joint conference on artificial intelligence Zhang J, Philip SY (2015) June). Integrated anchor and social link predictions across social networks, In Twenty-fourth international joint conference on artificial intelligence
Metadaten
Titel
Identifying multiple social network accounts belonging to the same users
verfasst von
Ahmet Anıl Müngen
Esra Gündoğan
Mehmet Kaya
Publikationsdatum
01.12.2021
Verlag
Springer Vienna
Erschienen in
Social Network Analysis and Mining / Ausgabe 1/2021
Print ISSN: 1869-5450
Elektronische ISSN: 1869-5469
DOI
https://doi.org/10.1007/s13278-021-00736-0

Weitere Artikel der Ausgabe 1/2021

Social Network Analysis and Mining 1/2021 Zur Ausgabe

Premium Partner