{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T21:13:51Z","timestamp":1673471631064},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,2,5]],"date-time":"2014-02-05T00:00:00Z","timestamp":1391558400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1007\/s13278-014-0156-x","type":"journal-article","created":{"date-parts":[[2014,2,4]],"date-time":"2014-02-04T09:18:30Z","timestamp":1391505510000},"source":"Crossref","is-referenced-by-count":2,"title":["STUN: querying spatio-temporal uncertain (social) networks"],"prefix":"10.1007","volume":"4","author":[{"given":"Chanhyun","family":"Kang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Pugliese","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Grant","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. S.","family":"Subrahmanian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,2,5]]},"reference":[{"key":"156_CR1","doi-asserted-by":"crossref","unstructured":"Albanese M, Broecheler M, Grant J, Martinez MV, Subrahmanian V (2011) Plini: a probabilistic logic program framework for inconsistent news information. In: Logic programming, knowledge representation, and nonmonotonic reasoning, Springer, LNAI 6565,\u00a0pp 347\u2013376","DOI":"10.1007\/978-3-642-20832-4_23"},{"key":"156_CR2","doi-asserted-by":"crossref","unstructured":"Baeza-Yates RA, Davis E (2004) Web page ranking using link attributes. In: Feldman SI, Uretsky M, Najork M, Wills CE (eds), WWW (Alternate Track Papers & Posters), ACM, New York, pp 328\u2013329","DOI":"10.1145\/1013367.1013459"},{"key":"156_CR3","doi-asserted-by":"crossref","unstructured":"Bahmani B, Chakrabarti K, Xin D (2011) Fast personalized pagerank on mapreduce. In: Sellis TK, Miller RJ, Kementsietsidis A, Velegrakis Y (eds) SIGMOD Conference. ACM, New York, pp 973\u2013984","DOI":"10.1145\/1989323.1989425"},{"issue":"1","key":"156_CR4","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1080\/15427951.2005.10129098","volume":"2","author":"P Berkhin","year":"2005","unstructured":"Berkhin P (2005) Survey: a survey on pagerank computing. Internet Math 2(1):73\u2013120","journal-title":"Internet Math"},{"issue":"1","key":"156_CR5","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/1217299.1217304","volume":"1","author":"I Bhattacharya","year":"2007","unstructured":"Bhattacharya I, Getoor L (2007) Collective entity resolution in relational data. ACM Trans Knowl Discov Data (TKDD) 1(1):5","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"key":"156_CR6","doi-asserted-by":"crossref","unstructured":"Boldi P (2005) Totalrank: ranking without damping. In: Ellis A, Hagino T (eds) WWW (Special interest tracks and posters), ACM, New York, pp 898\u2013899","DOI":"10.1145\/1062745.1062787"},{"key":"156_CR7","doi-asserted-by":"crossref","unstructured":"Brocheler M, Pugliese A, Subrahmanian V (2011) Probabilistic subgraph matching on huge social networks. In: Advances in social networks analysis and mining (ASONAM), IEEE International Conference 2011 pp 271\u2013278","DOI":"10.1109\/ASONAM.2011.78"},{"key":"156_CR8","doi-asserted-by":"crossref","unstructured":"Broecheler M, Pugliese A, Subrahmanian VS (2009) DOGMA: a disk-oriented graph matching algorithm for RDF databases. In: ISWC,\u00a0pp 97\u2013113","DOI":"10.1007\/978-3-642-04930-9_7"},{"key":"156_CR9","doi-asserted-by":"crossref","unstructured":"Broecheler M, Pugliese A, Subrahmanian VS (2010) Cosi: Cloud oriented subgraph identification in massive social networks. In: ASONAM, pp 248\u2013255","DOI":"10.1109\/ASONAM.2010.80"},{"issue":"1","key":"156_CR10","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/s13278-012-0060-1","volume":"3","author":"S Catanese","year":"2013","unstructured":"Catanese S, Ferrara E, Fiumara G (2013) Forensic analysis of phone call networks. Soc Netw Anal Min 3(1):15\u201333","journal-title":"Soc Netw Anal Min"},{"key":"156_CR11","doi-asserted-by":"crossref","unstructured":"Chakrabarti S (2007) Dynamic personalized pagerank in entity-relation graphs. In: Williamson CL, Zurko ME, Patel-Schneider PF, Shenoy PJ (eds) WWW ACM, New York, pp 571\u2013580","DOI":"10.1145\/1242572.1242650"},{"key":"156_CR12","doi-asserted-by":"crossref","unstructured":"Cheng J, Yu JX, Ding B, Yu PS, Wang H (2008) Fast graph pattern matching. In: ICDE conference, pp 913\u2013922","DOI":"10.1109\/ICDE.2008.4497500"},{"key":"156_CR13","doi-asserted-by":"crossref","unstructured":"Chitrapura KP, Kashyap SR (2004) Node ranking in labeled directed graphs. In: Grossman DA, Gravano L, Zhai C, Herzog O, Evans DA (eds) CIKM, ACM, New York, pp 597\u2013606","DOI":"10.1145\/1031171.1031281"},{"key":"156_CR14","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1186\/1471-2105-11-96","volume":"11","author":"R Di Natale","year":"2010","unstructured":"Di Natale R, Ferro A, Giugno R, Mongiov\u00ec M, Pulvirenti A, Shasha D (2010) SING: subgraph search in non-homogeneous graphs. BMC Bioinformatics 11:96","journal-title":"BMC Bioinformatics"},{"issue":"3","key":"156_CR15","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1080\/15427951.2005.10129104","volume":"2","author":"D Fogaras","year":"2005","unstructured":"Fogaras D, R\u00e1cz B, Csalog\u00e1ny K, Sarl\u00f3s T (2005) Towards scaling fully personalized pagerank: Algorithms, lower bounds, and experiments. Internet Math 2(3):333\u2013358","journal-title":"Internet Math"},{"key":"156_CR16","doi-asserted-by":"crossref","unstructured":"Gullapalli A, Carley K (2013) Extracting ordinal temporal trail clusters in networks using symbolic time-series analysis. Soc Netw Anal Mining 3(4):1179\u20131194","DOI":"10.1007\/s13278-012-0091-7"},{"key":"156_CR17","unstructured":"Gupta R, Sarawagi S (2006) Creating probabilistic databases from information extraction models. In: VLDB 32:965"},{"key":"156_CR18","doi-asserted-by":"crossref","unstructured":"Harth A, Decker S (2005) Optimized index structures for querying RDF from the Web. In: Proceedings of the 3rd Latin American Web Congress, pp 71\u201380","DOI":"10.1109\/LAWEB.2005.25"},{"key":"156_CR19","doi-asserted-by":"crossref","unstructured":"Haveliwala TH (2002) Topic-sensitive pagerank. In: WWW, pp 517\u2013526","DOI":"10.1145\/511446.511513"},{"key":"156_CR20","unstructured":"Kang C, Pugliese A, Grant J, Subrahmanian VS (2012) STUN: spatio-temporal uncertain (social) networks. In: ASONAM"},{"issue":"1","key":"156_CR21","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis G, Kumar V (1998) A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J Sci Comput 20(1):359\u2013392","journal-title":"SIAM J Sci Comput"},{"issue":"2","key":"156_CR22","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s13278-011-0044-6","volume":"2","author":"M Kas","year":"2012","unstructured":"Kas M, Carley KM, Carley LR (2012) Trends in science networks: understanding structures and statistics of scientific networks. Soc Netw Anal Mining 2(2):169\u2013187","journal-title":"Soc Netw Anal Mining"},{"key":"156_CR23","doi-asserted-by":"crossref","unstructured":"Kashima H, Kato T, Yamanishi Y, Sugiyama M, Tsuda K (2009) Link propagation: a fast semi-supervised learning algorithm for link prediction. In: SDM 9:1099\u20131110","DOI":"10.1137\/1.9781611972795.94"},{"key":"156_CR24","doi-asserted-by":"crossref","unstructured":"Kim M, Leskovec J (2011) The network completion problem: inferring missing nodes and edges in networks. In: SDM pp 47\u201358","DOI":"10.1137\/1.9781611972818.5"},{"issue":"3","key":"156_CR25","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1080\/15427951.2004.10129091","volume":"1","author":"AN Langville","year":"2003","unstructured":"Langville AN, Meyer CD (2003) Survey: deeper inside pagerank. Internet Math 1(3):335\u2013380","journal-title":"Internet Math"},{"issue":"5","key":"156_CR26","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1093\/bib\/bbq015","volume":"11","author":"H Li","year":"2010","unstructured":"Li H, Homer N (2010) A survey of sequence alignment algorithms for next-generation sequencing. Brief Bioinf 11(5):473\u2013483","journal-title":"Brief Bioinf"},{"issue":"7","key":"156_CR27","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":"156_CR28","doi-asserted-by":"crossref","unstructured":"Mani I (2004) Recent developments in temporal information extraction. In: Proceedings of the International Conference on Recent Advances in Natural Language Processing (RANLP03) pp 45\u201360","DOI":"10.1075\/cilt.260.06man"},{"key":"156_CR29","doi-asserted-by":"crossref","unstructured":"Mislove A, Marcon M, Gummadi PK, Druschel P, Bhattacharjee B (2007) Measurement and analysis of online social networks. In: Internet Measurement Conference pp 29\u201342","DOI":"10.1145\/1298306.1298311"},{"key":"156_CR30","unstructured":"Nemirovsky D, Avrachenkov K (2008) Weighted pagerank: Cluster-related weights. In: Voorhees EM, Buckland LP (eds) TREC, National Institute of Standards and Technology (NIST), special publication vol 500-277"},{"key":"156_CR31","unstructured":"Page L, Brin S, Motwani R, Winograd T (1999) The pagerank citation ranking: Bringing order to the web. Technical Report 1999\u201366, Stanford InfoLab"},{"key":"156_CR32","doi-asserted-by":"crossref","unstructured":"Sintek M, Kiesel M (2006) RDFBroker: a signature-based high-performance RDF store. In: ESWC, pp 363\u2013377","DOI":"10.1007\/11762256_28"},{"key":"156_CR33","doi-asserted-by":"crossref","unstructured":"Theoharis Y, Christophides V, Karvounarakis G (2005) Benchmarking database representations of rdf\/s stores. In: Gil Y, Motta E, Benjamins VR, Musen MA (eds) International Semantic Web Conference, Lecture Notes in Computer Science, Springer, 3729:685\u2013701","DOI":"10.1007\/11574620_49"},{"issue":"2","key":"156_CR34","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1145\/1656242.1656245","volume":"11","author":"O Udrea","year":"2010","unstructured":"Udrea O, Recupero DR, Subrahmanian VS (2010) Annotated rdf. ACM Trans Comput Logic 11(2):10:1\u201310:41","journal-title":"ACM Trans Comput Logic"},{"key":"156_CR35","unstructured":"UzZaman N., Allen JF (2010) Trips and trios system for tempeval-2: extracting temporal information from text. In: Proceedings of the 5th International Workshop on Semantic Evaluation, Association for Computational Linguistics, pp 276\u2013283"},{"key":"156_CR36","unstructured":"Vacic V, Jin H, Zhu JK, Lonardi S (2008) A probabilistic method for small rna flowgram matching. In: Pacific Symposium on Biocomputing, NIH Public Access, p 75"},{"issue":"1-2","key":"156_CR37","doi-asserted-by":"crossref","first-page":"1057","DOI":"10.14778\/1920841.1920974","volume":"3","author":"DZ Wang","year":"2010","unstructured":"Wang DZ, Franklin MJ, Garofalakis M, Hellerstein JM (2010) Querying probabilistic information extraction. Proc VLDB Endow 3(1-2):1057\u20131067","journal-title":"Proc VLDB Endow"},{"key":"156_CR38","first-page":"7","volume":"3","author":"K Wilkinson","year":"2003","unstructured":"Wilkinson K, Sayers C, Kuno H, Reynolds D (2003) Efficient RDF storage and retrieval in Jena2. SWDB Conf 3:7\u20138","journal-title":"SWDB Conf"},{"key":"156_CR39","doi-asserted-by":"crossref","unstructured":"Zhang S, Li S, Yang J (2009) GADDI: distance index based subgraph matching in biological networks. In: EDBT Conference pp 192\u2013203","DOI":"10.1145\/1516360.1516384"},{"key":"156_CR40","doi-asserted-by":"crossref","unstructured":"Zhang S, Li S, Yang J (2010) SUMMA: subgraph matching in massive graphs. In: CIKM Conference pp 1285\u20131288","DOI":"10.1145\/1871437.1871602"},{"key":"156_CR41","doi-asserted-by":"crossref","unstructured":"Zhu K, Zhang Y, Lin X, Zhu G (2010) NOVA: a novel and efficient framework for finding subgraph isomorphism mappings in large graphs. In: DASFAA Conference, pp 140\u2013154","DOI":"10.1007\/978-3-642-12026-8_13"},{"issue":"1","key":"156_CR42","first-page":"886","volume":"2","author":"L Zou","year":"2009","unstructured":"Zou L, Chen L, \u00d6zsu MT (2009) Distancejoin: pattern match query in a large graph database. VLDB Conf 2(1):886\u2013897","journal-title":"VLDB Conf"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-014-0156-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13278-014-0156-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-014-0156-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T04:55:07Z","timestamp":1565153707000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13278-014-0156-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,5]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["156"],"URL":"https:\/\/doi.org\/10.1007\/s13278-014-0156-x","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"value":"1869-5450","type":"print"},{"value":"1869-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,5]]},"article-number":"156"}}