{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T11:20:47Z","timestamp":1762341647160,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,3,11]],"date-time":"2021-03-11T00:00:00Z","timestamp":1615420800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,11]],"date-time":"2021-03-11T00:00:00Z","timestamp":1615420800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004410","name":"T\u00fcrkiye Bilimsel ve Teknolojik Ara\u015ftirma Kurumu","doi-asserted-by":"publisher","award":["119E309"],"award-info":[{"award-number":["119E309"]}],"id":[{"id":"10.13039\/501100004410","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s13278-021-00736-0","type":"journal-article","created":{"date-parts":[[2021,3,11]],"date-time":"2021-03-11T03:02:43Z","timestamp":1615431763000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Identifying multiple social network accounts belonging to the same users"],"prefix":"10.1007","volume":"11","author":[{"given":"Ahmet An\u0131l","family":"M\u00fcngen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Esra","family":"G\u00fcndo\u011fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2995-8282","authenticated-orcid":false,"given":"Mehmet","family":"Kaya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,3,11]]},"reference":[{"issue":"3","key":"736_CR1","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.socnet.2005.01.007","volume":"27","author":"L Adamic","year":"2005","unstructured":"Adamic L, Adar E (2005) How to search a social network. Soc Netw 27(3):187\u2013203","journal-title":"Soc Netw"},{"key":"736_CR2","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/j.future.2018.06.050","volume":"89","author":"S Aslan","year":"2018","unstructured":"Aslan S, Kaya M (2018) Topic recommendation for authors as a link prediction problem. Futur Gener Comput Syst 89:249\u2013264","journal-title":"Futur Gener Comput Syst"},{"key":"736_CR3","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.ins.2019.01.023","volume":"483","author":"S Bag","year":"2019","unstructured":"Bag S, Kumar SK, Tiwari MK (2019) An efficient recommendation generation using relevant Jaccard similarity. Inf Sci 483:53\u201364","journal-title":"Inf Sci"},{"key":"736_CR4","unstructured":"Berlingerio M, Koutra D, Eliassi-Rad T, Faloutsos C (2012) Netsimile: a scalable approach to size-independent network similarity.\u00a0arXiv:1209.2684"},{"key":"736_CR5","doi-asserted-by":"crossref","unstructured":"Br\u00f3dka P (2016) A method for group extraction and analysis in multilayer social networks.\u00a0PhD Thesis, Wroclaw University of Technology","DOI":"10.1007\/978-1-4614-7163-9_239-1"},{"key":"736_CR6","doi-asserted-by":"publisher","first-page":"1136","DOI":"10.1016\/j.physa.2019.04.015","volume":"525","author":"E B\u00fct\u00fcn","year":"2019","unstructured":"B\u00fct\u00fcn E, Kaya M (2019) A pattern based supervised link prediction in directed complex networks. Physica A 525:1136\u20131145","journal-title":"Physica A"},{"issue":"10","key":"736_CR7","doi-asserted-by":"publisher","first-page":"4518","DOI":"10.1109\/TCYB.2019.2900495","volume":"50","author":"E B\u00fct\u00fcn","year":"2020","unstructured":"B\u00fct\u00fcn E, Kaya M (2020) Predicting citation count of scientists as a link prediction problem. IEEE Transact Cybern 50(10):4518\u20134529","journal-title":"IEEE Transact Cybern"},{"key":"736_CR8","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/j.ins.2018.06.051","volume":"463","author":"E B\u00fct\u00fcn","year":"2018","unstructured":"B\u00fct\u00fcn E, Kaya M, Alhajj R (2018) Extension of neighbor-based link prediction methods for directed, weighted and temporal social networks. Inf Sci 463:152\u2013165","journal-title":"Inf Sci"},{"key":"736_CR9","doi-asserted-by":"crossref","unstructured":"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\u201321","DOI":"10.1109\/ICSMC.2011.6083997"},{"key":"736_CR10","doi-asserted-by":"publisher","first-page":"47114","DOI":"10.1109\/ACCESS.2019.2909089","volume":"7","author":"K Deng","year":"2019","unstructured":"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\u201347123","journal-title":"IEEE Access"},{"key":"736_CR11","doi-asserted-by":"crossref","unstructured":"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\u2013190","DOI":"10.1109\/ICDM.2012.140"},{"key":"736_CR12","doi-asserted-by":"crossref","unstructured":"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\u20131329","DOI":"10.1145\/3219819.3220025"},{"issue":"1","key":"736_CR13","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/TCBB.2014.2326862","volume":"12","author":"FE Faisal","year":"2014","unstructured":"Faisal FE, Zhao H, Milenkovi\u0107 T (2014) Global network alignment in the context of aging. IEEE\/ACM Trans Comput Biol Bioinf 12(1):40\u201352","journal-title":"IEEE\/ACM Trans Comput Biol Bioinf"},{"key":"736_CR14","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.patcog.2018.09.014","volume":"87","author":"DE Fishkind","year":"2019","unstructured":"Fishkind DE, Adali S, Patsolic HG, Meng L, Singh D, Lyzinski V, Priebe CE (2019) Seeded graph matching. Pattern Recogn 87:203\u2013215","journal-title":"Pattern Recogn"},{"issue":"3","key":"736_CR15","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1109\/TKDE.2007.46","volume":"19","author":"F Fouss","year":"2007","unstructured":"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\u2013369","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"736_CR16","doi-asserted-by":"crossref","unstructured":"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\u2013543","DOI":"10.1145\/775047.775126"},{"key":"736_CR17","doi-asserted-by":"crossref","unstructured":"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\u201353","DOI":"10.1109\/BigDataService49289.2020.00015"},{"key":"736_CR18","doi-asserted-by":"crossref","unstructured":"Kleinberg J (2000) The small-world phenomenon: an algorithmic perspective. In\u00a0Proceedings of the thirty-second annual ACM symposium on Theory of computing. pp. 163\u2013170","DOI":"10.1145\/335305.335325"},{"key":"736_CR19","doi-asserted-by":"crossref","unstructured":"Koutra D, Tong H, Lubensky D (2013) Big-align: fast bipartite graph alignment. In: 2013 IEEE 13th international conference on data mining, pp 389\u2013398","DOI":"10.1109\/ICDM.2013.152"},{"key":"736_CR20","unstructured":"Koutra D, Parikh A, Ramdas A, Xiang J (2016) Algorithms for graph similarity and subgraph matching. Phys Rev Lett"},{"issue":"10","key":"736_CR21","doi-asserted-by":"publisher","first-page":"1390","DOI":"10.1093\/bioinformatics\/btr127","volume":"27","author":"O Kuchaiev","year":"2011","unstructured":"Kuchaiev O, Pr\u017eulj N (2011) Integrative network alignment reveals large regions of global network similarity in yeast and human. Bioinformatics 27(10):1390\u20131396","journal-title":"Bioinformatics"},{"key":"736_CR22","doi-asserted-by":"crossref","unstructured":"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\u2013580","DOI":"10.1145\/2487575.2487592"},{"key":"736_CR23","doi-asserted-by":"crossref","unstructured":"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\u2013247","DOI":"10.1109\/NAFOSTED.2017.8108071"},{"key":"736_CR24","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.ins.2019.08.022","volume":"506","author":"Y Li","year":"2020","unstructured":"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\u201398","journal-title":"Inf Sci"},{"issue":"7","key":"736_CR25","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1002\/asi.20591","volume":"58","author":"D Liben-Nowell","year":"2007","unstructured":"Liben-Nowell D, Kleinberg J (2007) The link-prediction problem for social networks. J Am Soc Inform Sci Technol 58(7):1019\u20131031","journal-title":"J Am Soc Inform Sci Technol"},{"key":"736_CR26","doi-asserted-by":"crossref","unstructured":"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\u201362","DOI":"10.1145\/2588555.2588559"},{"key":"736_CR27","unstructured":"Liu L, Cheung WK, Li X, Liao L (2016) Aligning users across social networks using network embedding. In\u00a0Ijcai\u00a0(pp. 1774\u20131780)."},{"issue":"4","key":"736_CR28","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/j.jda.2007.08.003","volume":"7","author":"S Peyer","year":"2009","unstructured":"Peyer S, S., Rautenbach, D., & Vygen, J. (2009) A generalization of Dijkstra\u2019s shortest path algorithm with applications to VLSI routing. J Discret Algorithms 7(4):377\u2013390","journal-title":"J Discret Algorithms"},{"key":"736_CR29","doi-asserted-by":"crossref","unstructured":"Rahman MM (2012) Intellectual knowledge extraction from online social data. Paper presented at 2012 international conference on informatics, electronics & vision (ICIEV). pp. 205\u2013210","DOI":"10.1109\/ICIEV.2012.6317392"},{"key":"736_CR30","doi-asserted-by":"publisher","unstructured":"Ribeiro LFR, Saverese PHP, Figueiredo DR. (2017) Struc2vec: learning node representations from structural identity. DOI: https:\/\/doi.org\/10.1145\/3097983.3098061","DOI":"10.1145\/3097983.3098061"},{"key":"736_CR31","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-662-48221-6_2","volume-title":"International workshop on algorithms in bioinformatics","author":"Y Sun","year":"2015","unstructured":"Sun Y, Crawford J, Tang J, Milenkovi\u0107 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\u201339"},{"issue":"4","key":"736_CR32","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1007\/s11280-013-0228-2","volume":"17","author":"P Symeonidis","year":"2014","unstructured":"Symeonidis P, Tiakas E (2014) Transitive node similarity: predicting and recommending links in signed social networks. World Wide Web 17(4):743\u2013776","journal-title":"World Wide Web"},{"key":"736_CR33","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1609\/aaai.v28i1.8720"},{"key":"736_CR34","doi-asserted-by":"crossref","unstructured":"Wang M, Tan Q, Wang X, Shi J (2018) De-anonymizing social networks user via profile similarity. In\u00a02018 IEEE Third International Conference on Data Science in Cyberspace (DSC)\u00a0(pp. 889\u2013895). IEEE.","DOI":"10.1109\/DSC.2018.00142"},{"key":"736_CR35","doi-asserted-by":"crossref","unstructured":"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\u00a02019 IEEE Fourth International Conference on Data Science in Cyberspace (DSC)\u00a0(pp. 432\u2013438). IEEE.","DOI":"10.1109\/DSC.2019.00072"},{"key":"736_CR36","unstructured":"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\u00a0International Conference on Machine Learning\u00a0(pp. 298\u2013306)."},{"key":"736_CR37","doi-asserted-by":"publisher","first-page":"38208","DOI":"10.1038\/srep38208","volume":"6","author":"J Yang","year":"2016","unstructured":"Yang J, Zhang XD (2016) Predicting missing links in complex networks based on common neighbors and distance. Scientific reports 6:38208","journal-title":"Scientific reports"},{"key":"736_CR38","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2007.01.006","author":"LA Zager","year":"2008","unstructured":"Zager LA, Verghese GC (2008) Graph similarity scoring and matching. Appl Math Lett. https:\/\/doi.org\/10.1016\/j.aml.2007.01.006","journal-title":"Appl Math Lett"},{"key":"736_CR39","volume-title":"June)","author":"J Zhang","year":"2015","unstructured":"Zhang J, Philip SY (2015) June). Integrated anchor and social link predictions across social networks, In Twenty-fourth international joint conference on artificial intelligence"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-021-00736-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13278-021-00736-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-021-00736-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,21]],"date-time":"2022-12-21T02:56:10Z","timestamp":1671591370000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13278-021-00736-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,11]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["736"],"URL":"https:\/\/doi.org\/10.1007\/s13278-021-00736-0","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"type":"print","value":"1869-5450"},{"type":"electronic","value":"1869-5469"}],"subject":[],"published":{"date-parts":[[2021,3,11]]},"assertion":[{"value":"22 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 February 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 February 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 March 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"29"}}