{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T15:36:40Z","timestamp":1776785800014,"version":"3.51.2"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,9,20]],"date-time":"2015-09-20T00:00:00Z","timestamp":1442707200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s13278-015-0296-7","type":"journal-article","created":{"date-parts":[[2015,9,20]],"date-time":"2015-09-20T08:56:16Z","timestamp":1442739376000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["SAMI: an algorithm for solving the missing node problem using structure and attribute information"],"prefix":"10.1007","volume":"5","author":[{"given":"Sigal","family":"Sina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Avi","family":"Rosenfeld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sarit","family":"Kraus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,9,20]]},"reference":[{"issue":"3","key":"296_CR1","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0378-8733(03)00009-1","volume":"25","author":"LA Adamic","year":"2003","unstructured":"Adamic LA, Adar E (2003) Friends and neighbors on the web. Soc Netw 25(3):211\u2013230","journal-title":"Soc Netw"},{"key":"296_CR2","doi-asserted-by":"crossref","unstructured":"Backstrom L, Leskovec J (2011) Supervised random walks: predicting and recommending links in social networks. In: Proceedings of the fourth ACM international conference on Web search and data mining, ACM, pp 635\u2013644","DOI":"10.1145\/1935826.1935914"},{"key":"296_CR3","doi-asserted-by":"crossref","unstructured":"Becker R, Chernihov Y, Shavitt Y, Zilberman N (2012) An analysis of the steam community network evolution. In: Electrical & Electronics Engineers in Israel (IEEEI), 2012 IEEE 27th Convention of IEEE, pp 1\u20135","DOI":"10.1109\/EEEI.2012.6377133"},{"key":"296_CR4","doi-asserted-by":"crossref","unstructured":"Brand M (2005) A random walks perspective on maximizing satisfaction and profit. In: SIAM international conference on data mining, pp 12\u201319","DOI":"10.1137\/1.9781611972757.2"},{"issue":"7191","key":"296_CR5","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1038\/nature06830","volume":"453","author":"A Clauset","year":"2008","unstructured":"Clauset A, Moore C, Newman MEJ (2008) Hierarchical structure and the prediction of missing links in networks. Nature 453(7191):98\u2013101","journal-title":"Nature"},{"key":"296_CR6","doi-asserted-by":"crossref","unstructured":"Eslami M, Rabiee HR, Salehi M (2011) Dne: a method for extracting cascaded diffusion networks from social networks. In: SocialCom\/PASSAT, pp 41\u201348","DOI":"10.1109\/PASSAT\/SocialCom.2011.85"},{"key":"296_CR7","doi-asserted-by":"crossref","unstructured":"Eyal R, Rosenfeld A, Kraus S (2011) Identifying missing node information in social networks. In: Twenty-Fifth AAAI Conference on Artificial Intelligence","DOI":"10.1609\/aaai.v25i1.8094"},{"key":"296_CR8","doi-asserted-by":"crossref","unstructured":"Eyal R, Rosenfeld A, Sina S, Kraus S (2014) Predicting and identifying missing node information in social networks. ACM Transactions on Knowledge Discovery from Data (TKDD) (To Appear at)","DOI":"10.1145\/2536775"},{"issue":"3\u20135","key":"296_CR9","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato S (2010) Community detection in graphs. Phys Rep 486(3\u20135):75\u2013174","journal-title":"Phys Rep"},{"key":"296_CR10","unstructured":"Freno A,\u00a0Garriga G, Keller M (2011) Learning to recommend links using graph structure and node content. In: Neural information processing systems workshop on choice models and preference learning"},{"issue":"1\u20132","key":"296_CR11","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0004-3702(00)00081-3","volume":"126","author":"CP Gomes","year":"2001","unstructured":"Gomes CP, Selman B (2001) Algorithm portfolios. Artif Intell (AIJ) 126(1\u20132):43\u201362","journal-title":"Artif Intell (AIJ)"},{"issue":"4","key":"296_CR12","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1145\/2086737.2086741","volume":"5","author":"M Gomez-Rodriguez","year":"2012","unstructured":"Gomez-Rodriguez M, Leskovec J, Krause A (2012) Inferring networks of diffusion and influence. TKDD 5(4):21","journal-title":"TKDD"},{"key":"296_CR13","unstructured":"Gong NZ, Talwalkar A, Mackey LW, Huang L, Shin ECR, Stefanov E, Shi E, Song D (2011) Predicting links and inferring attributes using a social-attribute network (san). CoRR"},{"issue":"52","key":"296_CR14","doi-asserted-by":"crossref","first-page":"22073","DOI":"10.1073\/pnas.0908366106","volume":"106","author":"R Guimer\u00e0","year":"2009","unstructured":"Guimer\u00e0 R, Sales-Pardo M (2009) Missing and spurious interactions and the reconstruction of complex networks. Proc Natl Acad Sci 106(52):22073\u201322078","journal-title":"Proc Natl Acad Sci"},{"key":"296_CR15","unstructured":"Halkidi M, Vazirgiannis M (2001) A data set oriented approach for clustering algorithm selection. In: PKDD, pp 165\u2013179"},{"key":"296_CR16","doi-asserted-by":"crossref","unstructured":"Kadioglu S, Malitsky Y, Sellmann M, Tierney K (2010) Isac\u2014instance-specific algorithm configuration. In: ECAI, pp 751\u2013756","DOI":"10.3233\/978-1-60750-606-5-751"},{"issue":"1","key":"296_CR17","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF02289026","volume":"18","author":"L Katz","year":"1953","unstructured":"Katz L (1953) A new status index derived from sociometric analysis. Psychometrika 18(1):39\u201343","journal-title":"Psychometrika"},{"key":"296_CR18","doi-asserted-by":"crossref","unstructured":"Kim M, Leskovec J (2011) The network completion problem: inferring missing nodes and edges in networks. In: SIAM international conference on data mining (SDM), 2011","DOI":"10.1137\/1.9781611972818.5"},{"key":"296_CR19","unstructured":"Kim M, Leskovec J (2012) Latent multi-group membership graph model. arXiv:1205.4546"},{"key":"296_CR20","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/j.socnet.2005.07.002","volume":"28","author":"G Kossinets","year":"2003","unstructured":"Kossinets G (2003) Effects of missing data in social networks. Soc Netw 28:247\u2013268","journal-title":"Soc Netw"},{"key":"296_CR21","doi-asserted-by":"crossref","unstructured":"Kostakis O, Kinable J, Mahmoudi H, Mustonen K (2011) Improved call graph comparison using simulated annealing. In: Proceedings of the 2011 ACM symposium on applied computing, ser. SAC \u201911, pp 1516\u20131523","DOI":"10.1145\/1982185.1982509"},{"key":"296_CR22","doi-asserted-by":"crossref","unstructured":"Leroy V, Cambazoglu BB, Bonchi F (2010) Cold start link prediction. SIGKDD 2010","DOI":"10.1145\/1835804.1835855"},{"key":"296_CR23","doi-asserted-by":"crossref","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2005) Graphs over time: densification laws, shrinking diameters and possible explanations. In: Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining. ACM, pp 177\u2013187","DOI":"10.1145\/1081870.1081893"},{"key":"296_CR24","doi-asserted-by":"crossref","unstructured":"Leskovec J, Faloutsos C (2006)Sampling from large graphs. In: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 631\u2013636","DOI":"10.1145\/1150402.1150479"},{"issue":"7","key":"296_CR25","doi-asserted-by":"crossref","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 Inf Sci Technol 58(7):1019\u20131031","journal-title":"J Am Soc Inf Sci Technol"},{"key":"296_CR26","doi-asserted-by":"crossref","unstructured":"Lin W, Kong X, Yu PS, Wu Q, Jia Y, Li C (2012) Community detection in incomplete information networks. In: WWW, pp 341\u2013350","DOI":"10.1145\/2187836.2187883"},{"key":"296_CR28","doi-asserted-by":"crossref","unstructured":"McPherson M, Smith-Lovin L, Cook JM (2001) Birds of a feather: Homophily in social networks. Ann Rev Sociol, pp 415\u2013444","DOI":"10.1146\/annurev.soc.27.1.415"},{"issue":"1\u20133","key":"296_CR29","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0004-3702(92)90007-K","volume":"58","author":"S Minton","year":"1992","unstructured":"Minton S, Johnston MD, Philips AB, Laird P (1992) Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artif Intell 58(1\u20133):161\u2013205","journal-title":"Artif Intell"},{"key":"296_CR30","unstructured":"Ng AY, Jordan MI, Weiss Y (2001) On spectral clustering: analysis and an algorithm. In: Advances in neural information processing systems 14, MIT Press, pp 849\u2013856"},{"issue":"9","key":"296_CR31","first-page":"1082","volume":"56","author":"MA Porter","year":"2009","unstructured":"Porter MA, Onnela J-P, Mucha PJ (2009) Communities in networks. Not Am Math Soc 56(9):1082\u20131097","journal-title":"Not Am Math Soc"},{"key":"296_CR32","first-page":"118","volume":"15","author":"JR Rice","year":"1976","unstructured":"Rice JR (1976) he algorithm selection problem. Adv Comput 15:118\u2013165","journal-title":"Adv Comput"},{"key":"296_CR33","doi-asserted-by":"crossref","unstructured":"Sadikov E, Medina M, Leskovec J, Garcia-Molina H (2011) Correcting for missing data in information cascades. In: WSDM, pp 55\u201364","DOI":"10.1145\/1935826.1935844"},{"key":"296_CR34","doi-asserted-by":"crossref","unstructured":"Sina S, Rosenfeld A, Kraus S (2013) Solving the missing node problem using structure and attribute information. In: Proceedings of the 2013 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining, ACM, pp 744\u2013751","DOI":"10.1145\/2492517.2492534"},{"key":"296_CR35","first-page":"583","volume":"3","author":"A Strehl","year":"2003","unstructured":"Strehl A, Ghosh J (2003) Cluster ensembles\u2014a knowledge reuse framework for combining multiple partitions. J Mach Learn Res 3:583\u2013617","journal-title":"J Mach Learn Res"},{"key":"296_CR36","first-page":"324","volume":"18","author":"S Talman","year":"2005","unstructured":"Talman S, Toister R, Kraus S (2005) Choosing between heuristics and strategies: an enhanced model for decision-making. Int Jt Conf Artif Intell 18:324\u2013330","journal-title":"Int Jt Conf Artif Intell"},{"issue":"4","key":"296_CR27","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U Luxburg von","year":"2007","unstructured":"von Luxburg U (2007) A tutorial on spectral clustering. Stat Comput 17(4):395\u2013416","journal-title":"Stat Comput"},{"key":"296_CR37","doi-asserted-by":"crossref","unstructured":"Yin Z, Gupta M, Weninger T, Han J (2010) Linkrec: a unified framework for link recommendation with user attributes and graph structure. In: Proceedings of the 19th international conference on World wide web. ACM, pp 1211\u20131212","DOI":"10.1145\/1772690.1772879"},{"key":"296_CR38","doi-asserted-by":"crossref","unstructured":"Yin Z, Gupta M, Weninger T, Han J (2010) A unified framework for link recommendation using random walks. In: Advances in Social Networks Analysis and Mining (ASONAM), 2010 International Conf. on IEEE, pp 152\u2013159","DOI":"10.1109\/ASONAM.2010.27"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-015-0296-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13278-015-0296-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-015-0296-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T18:36:31Z","timestamp":1748630191000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13278-015-0296-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,20]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["296"],"URL":"https:\/\/doi.org\/10.1007\/s13278-015-0296-7","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"value":"1869-5450","type":"print"},{"value":"1869-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9,20]]},"article-number":"54"}}