{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,15]],"date-time":"2023-08-15T17:14:04Z","timestamp":1692119644487},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,10,27]],"date-time":"2015-10-27T00:00:00Z","timestamp":1445904000000},"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-0302-0","type":"journal-article","created":{"date-parts":[[2015,10,27]],"date-time":"2015-10-27T12:59:36Z","timestamp":1445950776000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the network you keep: analyzing persons of interest using Cliqster"],"prefix":"10.1007","volume":"5","author":[{"given":"Saber","family":"Shokat Fadaee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehrdad","family":"Farajtabar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ravi","family":"Sundaram","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Javed A.","family":"Aslam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikos","family":"Passas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,10,27]]},"reference":[{"key":"302_CR1","first-page":"1981","volume":"9","author":"EM Airoldi","year":"2008","unstructured":"Airoldi EM, Blei DM, Fienberg SE, Xing EP (2008) Mixed membership stochastic blockmodels. J Mach Learn Res 9:1981\u20132014","journal-title":"J Mach Learn Res"},{"key":"302_CR2","unstructured":"Airoldi EM (2006) Bayesian mixed-membership models of complex and evolving networks. Tech Rep, DTIC Document"},{"key":"302_CR3","unstructured":"Azari Soufiani H, Airoldi EM (2012) Graphlet decomposition of a weighted network. In: Proceedings of the fifteenth international conference on artificial intelligence and statistics (AISTATS). La Palma, Canary Islands"},{"key":"302_CR4","doi-asserted-by":"crossref","unstructured":"Barta G (2014) A link-based approach to entity resolution in social networks. CoRR, vol abs\/1404.3017","DOI":"10.5121\/csit.2014.4409"},{"key":"302_CR5","doi-asserted-by":"crossref","unstructured":"Bhagat S, Cormode G, Muthukrishnan S (2011) Node classification in social networks. CoRR, vol abs\/1101.3291","DOI":"10.1007\/978-1-4419-8462-3_5"},{"key":"302_CR6","doi-asserted-by":"crossref","unstructured":"Bilgic M, Licamele L, Getoor L, Shneiderman B (2006) D-dupe: an interactive tool for entity resolution in social networks. In: Visual analytics science and technology (VAST), Baltimore","DOI":"10.1109\/VAST.2006.261429"},{"key":"302_CR7","doi-asserted-by":"crossref","unstructured":"Boyd SP, Vandenberghe L (2004) Convex optimization. Cambridge University Press, Cambridge","DOI":"10.1017\/CBO9780511804441"},{"issue":"9","key":"302_CR8","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron C, Kerbosch J (1973) Finding all cliques of an undirected graph. Commun ACM 16(9):575\u2013579","journal-title":"Commun ACM"},{"key":"302_CR9","doi-asserted-by":"crossref","first-page":"1611","DOI":"10.1007\/s11590-013-0698-2","volume":"8","author":"A Buchanan","year":"2014","unstructured":"Buchanan A, Walteros J, Butenko S, Pardalos P (2014) Solving maximum clique in sparse graphs: an $$O(nm + n2^{d\/4})$$ O ( n m + n 2 d \/ 4 ) algorithm for d-degenerate graphs. Optim Lett 8:1611\u20131617","journal-title":"Optim Lett"},{"key":"302_CR10","volume-title":"Spectral graph theory","author":"FRK Chung","year":"1997","unstructured":"Chung FRK (1997) Spectral graph theory. American Mathematical Society, Providence"},{"key":"302_CR11","unstructured":"Csardi G, Nepusz T (2006) The igraph software package for complex network research. Int J Complex Syst, 1695. http:\/\/igraph.org (online)"},{"key":"302_CR12","volume-title":"Networks, crowds, and markets: reasoning about a highly connected world","author":"E David","year":"2010","unstructured":"David E, Jon K (2010) Networks, crowds, and markets: reasoning about a highly connected world. Cambridge University Press, New York"},{"key":"302_CR13","unstructured":"Dow jones factiva (2013). http:\/\/www.dowjones.com\/products\/product-factiva\/ (online). Accessed Dec 2013"},{"key":"302_CR14","doi-asserted-by":"crossref","unstructured":"Eppstein D, Strash D (2011) Listing all maximal cliques in large sparse real-world graphs. In: Experimental algorithms. Springer, Berlin, pp 364\u2013375","DOI":"10.1007\/978-3-642-20662-7_31"},{"key":"302_CR15","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s P, R\u00e9nyi A (1959) On random graphs. Publ Math Debr 6:290\u2013297","journal-title":"Publ Math Debr"},{"key":"302_CR16","unstructured":"Factcheck (2013). http:\/\/www.factcheck.org\/archives\/ (online). Accessed Dec 2013"},{"issue":"4","key":"302_CR17","doi-asserted-by":"crossref","first-page":"1141","DOI":"10.1214\/aoms\/1177706098","volume":"30","author":"EN Gilbert","year":"1959","unstructured":"Gilbert EN (1959) Random graphs. Ann Math Stat 30(4):1141\u20131144","journal-title":"Ann Math Stat"},{"issue":"2","key":"302_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.18637\/jss.v064.i02","volume":"64","author":"CS Gillespie","year":"2015","unstructured":"Gillespie CS (2015) Fitting heavy tailed distributions: the poweRlaw package. J Stat Softw 64(2):1\u201316","journal-title":"J Stat Softw"},{"key":"302_CR19","doi-asserted-by":"crossref","unstructured":"Glaeser EL, Sacerdote B, Scheinkman JA (1996) Crime and social interactions. Q J Econ 111(2):507\u2013548","DOI":"10.2307\/2946686"},{"key":"302_CR20","doi-asserted-by":"crossref","unstructured":"Goldenberg A, Zheng AX, Fienberg SE, Airoldi EM (2009) A survey of statistical network models (arXiv e-prints)","DOI":"10.1561\/9781601983213"},{"key":"302_CR21","doi-asserted-by":"crossref","unstructured":"Henderson K, Gallagher B, Eliassi-Rad T, Tong H, Basu S, Akoglu L, Koutra D, Faloutsos C, Li L (2012) Rolx: structural role extraction and mining in large graphs. In: Proceedings of the 18th ACM SIGKDD international conference on knowledge discovery and data mining, ser. KDD \u201912. ACM, New York, pp 1231\u20131239","DOI":"10.1145\/2339530.2339723"},{"issue":"4","key":"302_CR22","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/s10588-008-9040-4","volume":"15","author":"P Hoff","year":"2009","unstructured":"Hoff P (2009) Multiplicative latent factor models for description and prediction of social networks. Comput Math Organ Theory 15(4):261\u2013272","journal-title":"Comput Math Organ Theory"},{"key":"302_CR23","unstructured":"Interpol (2013). http:\/\/www.interpol.int\/INTERPOL-expertise\/Databases (online). Accessed Dec 2013"},{"issue":"1","key":"302_CR24","doi-asserted-by":"crossref","first-page":"016107","DOI":"10.1103\/PhysRevE.83.016107","volume":"83","author":"B Karrer","year":"2011","unstructured":"Karrer B, Newman ME (2011) Stochastic blockmodels and community structure in networks. Phys Rev E 83(1):016107","journal-title":"Phys Rev E"},{"issue":"1\u20132","key":"302_CR25","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1080\/15427951.2012.625257","volume":"8","author":"M Kim","year":"2012","unstructured":"Kim M, Leskovec J (2012) Multiplicative attribute graph model of real-world networks. Internet Math 8(1\u20132):113\u2013160","journal-title":"Internet Math"},{"key":"302_CR26","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971217","volume-title":"Solving least squares problems","author":"CL Lawson","year":"1995","unstructured":"Lawson CL, Hanson RJ (1995) Solving least squares problems. Society for Industrial and Applied Mathematics (SIAM), Philadelphia"},{"key":"302_CR27","doi-asserted-by":"crossref","first-page":"1082","DOI":"10.4153\/CJM-1970-125-1","volume":"22","author":"DR Lick","year":"1970","unstructured":"Lick DR, White AT (1970) $$k$$ k -degenerate graphs. Can J Math 22:1082\u20131096","journal-title":"Can J Math"},{"key":"302_CR28","doi-asserted-by":"crossref","unstructured":"Li K, Guo S, Du N, Gao J, Zhang A (2013) Learning, analyzing and predicting object roles on dynamic networks. In: 2013 IEEE 13th international conference on data mining (ICDM), pp 428\u2013437","DOI":"10.1109\/ICDM.2013.95"},{"issue":"3","key":"302_CR29","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1007\/s10618-013-0330-1","volume":"27","author":"Y-C Lo","year":"2013","unstructured":"Lo Y-C, Li J-Y, Yeh M-Y, Lin S-D, Pei J (2013) What distinguish one from its peers in social networks? Data Min Knowl Discov 27(3):396\u2013420","journal-title":"Data Min Knowl Discov"},{"key":"302_CR30","unstructured":"Moustafa WE, Kimmig A, Deshpande A, Getoor L (2013) Subgraph pattern matching over uncertain graphs with identity linkage uncertainty. CoRR, vol abs\/1305.7006"},{"issue":"455","key":"302_CR31","doi-asserted-by":"crossref","first-page":"1077","DOI":"10.1198\/016214501753208735","volume":"96","author":"K Nowicki","year":"2001","unstructured":"Nowicki K, Snijders TAB (2001) Estimation and prediction for stochastic blockstructures. J Am Stat Assoc 96(455):1077\u20131087","journal-title":"J Am Stat Assoc"},{"key":"302_CR32","unstructured":"OFAC (2013) Office of foreign assets control. https:\/\/sdnsearch.ofac.treas.gov\/ (online)"},{"issue":"2","key":"302_CR33","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.euroecorev.2007.09.002","volume":"52","author":"E Patacchini","year":"2008","unstructured":"Patacchini E, Zenou Y (2008) The strength of weak ties in crime. Eur Econ Rev 52(2):209\u2013236","journal-title":"Eur Econ Rev"},{"key":"302_CR34","unstructured":"Persons of interest dataset (2013). http:\/\/www.ccs.neu.edu\/home\/saber\/poi.RData (online). Accessed Dec 2013"},{"key":"302_CR35","unstructured":"RCMP (2013) Royal canadian mounted police. http:\/\/www.rcmp-grc.gc.ca\/en\/ (online). Accessed Dec 2013"},{"key":"302_CR36","unstructured":"Reiss A (1980) Understanding changes in crime rates. In: Crime and justice: a review of research, vol 10"},{"key":"302_CR38","doi-asserted-by":"crossref","unstructured":"Robins G, Pattison P, Kalish Y, Lusher D (2007) An introduction to exponential random graph (p*) models for social networks, Social Networks, vol 29, no 2, pp 173\u2013191 (special section: Advances in exponential random graph (p*) models)","DOI":"10.1016\/j.socnet.2006.08.002"},{"key":"302_CR39","unstructured":"Rossi RA, Ahmed NK (2014) Role discovery in networks. IEEE Trans Knowl Data Eng 99:1"},{"key":"302_CR40","doi-asserted-by":"crossref","unstructured":"Shokat Fadaee S, Farajtabar M, Sundaram R, Aslam J, Passas N (2014) The network you keep: analyzing persons of interest using cliqster. In: 2014 IEEE\/ACM international conference on advances in social networks analysis and mining (ASONAM), pp 122\u2013129","DOI":"10.1109\/ASONAM.2014.6921571"},{"key":"302_CR37","unstructured":"Thomson Reuters (2013) World-check. https:\/\/risk.thomsonreuters.com\/products\/world-check (online). Accessed Dec 2013"},{"key":"302_CR41","unstructured":"UN (2013) United nations. http:\/\/data.un.org\/ (online). Accessed Dec 2013"},{"key":"302_CR42","doi-asserted-by":"crossref","unstructured":"Xu H, Yang Y, Wang L, Liu W (2013) Node classification in social network via a factor graph model. In: Pei J, Tseng V, Cao L, Motoda H, Xu G (eds) Advances in knowledge discovery and data mining, ser. Lecture Notes in Computer Science, vol 7818. Springer, Berlin, pp 213\u2013224","DOI":"10.1007\/978-3-642-37453-1_18"},{"key":"302_CR43","volume-title":"Proceedings of the twenty-ninth AAAI conference on artificial intelligence","author":"Y Yang","year":"2014","unstructured":"Yang Y, Tang J, Leung CW-K, Sun Y, Chen Q, Li J, Yang Q (2014) Rain: social role-aware information diffusion. In: Proceedings of the twenty-ninth AAAI conference on artificial intelligence. AAAI Publications, Austin"},{"key":"302_CR44","doi-asserted-by":"crossref","unstructured":"Zhao Y, Wang G, Yu PS, Liu S, Zhang S (2013) Inferring social roles and statuses in social networks. In: Proceedings of the 19th ACM SIGKDD international conference on knowledge discovery and data mining, ser. KDD \u201913. ACM, New York, pp 695\u2013703","DOI":"10.1145\/2487575.2487597"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-015-0302-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13278-015-0302-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-015-0302-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,15]],"date-time":"2023-08-15T16:56:41Z","timestamp":1692118601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13278-015-0302-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,27]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["302"],"URL":"https:\/\/doi.org\/10.1007\/s13278-015-0302-0","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"value":"1869-5450","type":"print"},{"value":"1869-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,27]]},"article-number":"63"}}