{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:48:58Z","timestamp":1742982538258,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319320489"},{"type":"electronic","value":"9783319320496"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-32049-6_18","type":"book-chapter","created":{"date-parts":[[2016,3,24]],"date-time":"2016-03-24T08:47:36Z","timestamp":1458809256000},"page":"283-298","source":"Crossref","is-referenced-by-count":5,"title":["Triangle-Based Representative Possible Worlds of Uncertain Graphs"],"prefix":"10.1007","author":[{"given":"Shaoying","family":"Song","sequence":"first","affiliation":[]},{"given":"Zhaonian","family":"Zou","sequence":"additional","affiliation":[]},{"given":"Kang","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,25]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Becchetti, L., Boldi, P., Castillo, C., Gionis, A.: Efficient semi-streaming algorithms for local triangle counting in massive graphs. In: KDD, pp. 16\u201324 (2008)","DOI":"10.1145\/1401890.1401898"},{"issue":"1","key":"18_CR2","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1186\/1471-2105-5-10","volume":"5","author":"R Dobrin","year":"2004","unstructured":"Dobrin, R., Beg, Q.K., Barab\u00e1si, A.L., Oltvai, Z.N.: Aggregation of topological motifs in the escherichia coli transcriptional regulatory network. BMC Bioinf. 5(1), 10 (2004)","journal-title":"BMC Bioinf."},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Elenberg, E.R., Shanmugam, K., Borokhovich, M., Dimakis, A.G.: Beyond triangles: a distributed framework for estimating 3-profiles of large graphs. In: KDD, pp. 229\u2013238 (2015)","DOI":"10.1145\/2783258.2783413"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Jin, R., Liu, L., Aggarwal, C.C.: Discovering highly reliable subgraphs in uncertain graphs. In: KDD, pp. 992\u20131000 (2011)","DOI":"10.1145\/2020408.2020569"},{"issue":"9","key":"18_CR5","first-page":"551","volume":"4","author":"R Jin","year":"2011","unstructured":"Jin, R., Liu, L., Ding, B., Wang, H.: Distance-constraint reachability computation in uncertain graphs. PVLDB 4(9), 551\u2013562 (2011)","journal-title":"PVLDB"},{"key":"18_CR6","unstructured":"Khan, A., Bonchi, F., Gionis, A., Gullo, F.: Fast reliability search in uncertain graphs. In: EDBT, pp. 535\u2013546 (2014)"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Faloutsos, C.: Sampling from large graphs. In: KDD, pp. 631\u2013636 (2006)","DOI":"10.1145\/1150402.1150479"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Li, R., Yu, J.X., Mao, R., Jin, T.: Efficient and accurate query evaluation on uncertain graphs via recursive stratified sampling. In: ICDE, pp. 892\u2013903 (2014)","DOI":"10.1109\/ICDE.2014.6816709"},{"issue":"7","key":"18_CR9","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.M.: The link-prediction problem for social networks. JASIST 58(7), 1019\u20131031 (2007)","journal-title":"JASIST"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Liu, L., Jin, R., Aggarwal, C.C., Shen, Y.: Reliable clustering on uncertain graphs. In: ICDM, pp. 459\u2013468 (2012)","DOI":"10.1109\/ICDM.2012.11"},{"issue":"1","key":"18_CR11","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/1111322.1111328","volume":"36","author":"P Mahadevan","year":"2006","unstructured":"Mahadevan, P., Krioukov, D.V., Fomenkov, M., Dimitropoulos, X.A., Claffy, K.C., Vahdat, A.: The internet as-level topology: three data sources and one definitive metric. Comput. Commun. Rev. 36(1), 17\u201326 (2006)","journal-title":"Comput. Commun. Rev."},{"issue":"5","key":"18_CR12","doi-asserted-by":"publisher","first-page":"058701","DOI":"10.1103\/PhysRevLett.103.058701","volume":"103","author":"MEJ Newman","year":"2009","unstructured":"Newman, M.E.J.: Random graphs with clustering. Phys. Rev. Lett. 103(5), 058701 (2009)","journal-title":"Phys. Rev. Lett."},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Parchas, P., Gullo, F., Papadias, D., Bonchi, F.: The pursuit of a good possible world: extracting representative instances of uncertain graphs. In: SIGMOD, pp. 967\u2013978 (2014)","DOI":"10.1145\/2588555.2593668"},{"issue":"1","key":"18_CR14","first-page":"997","volume":"3","author":"M Potamias","year":"2010","unstructured":"Potamias, M., Bonchi, F., Gionis, A., Kollios, G.: k-nearest neighbors in uncertain graphs. PVLDB 3(1), 997\u20131008 (2010)","journal-title":"PVLDB"},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Bioinformatics)","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/11799511_5","volume-title":"Data Integration in the Life Sciences","author":"P Sevon","year":"2006","unstructured":"Sevon, P., Eronen, L., Hintsanen, P., Kulovesi, K., Toivonen, H.: Link discovery in graphs derived from biological databases. In: Leser, U., Naumann, F., Eckman, B. (eds.) DILS 2006. LNCS (LNBI), vol. 4075, pp. 35\u201349. Springer, Heidelberg (2006)"},{"issue":"4","key":"18_CR16","first-page":"3123","volume":"6","author":"S Chu","year":"2012","unstructured":"Chu, S., Cheng, J.: Triangle listing in massive networks. ACM Trans. Knowl. Disc. Data 6(4), 3123 (2012)","journal-title":"ACM Trans. Knowl. Disc. Data"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C.E.: Fast counting of triangles in large real networks without counting: algorithms and laws. In: ICDM, pp. 608\u2013617 (2008)","DOI":"10.1109\/ICDM.2008.72"},{"issue":"9","key":"18_CR18","first-page":"800","volume":"5","author":"Y Yuan","year":"2012","unstructured":"Yuan, Y., Wang, G., Chen, L., Wang, H.: Efficient subgraph similarity search on large probabilistic graph databases. PVLDB 5(9), 800\u2013811 (2012)","journal-title":"PVLDB"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Zou, Z., Gao, H., Li, J.: Discovering frequent subgraphs over uncertain graph databases under probabilistic semantics. In: KDD, pp. 633\u2013642 (2010)","DOI":"10.1145\/1835804.1835885"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Zou, Z., Li, J.: Structural-context similarities for uncertain graphs. In: ICDM, pp. 1325\u20131330 (2013)","DOI":"10.1109\/ICDM.2013.22"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Zou, Z., Li, J., Gao, H., Zhang, S.: Frequent subgraph pattern mining on uncertain graph data. In: CIKM, pp. 583\u2013592 (2009)","DOI":"10.1145\/1645953.1646028"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Zou, Z., Li, J., Gao, H., Zhang, S.: Finding top-k maximal cliques in an uncertain graph. In: ICDE, pp. 649\u2013652 (2010)","DOI":"10.1109\/ICDE.2010.5447891"},{"issue":"9","key":"18_CR23","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.1109\/TKDE.2010.80","volume":"22","author":"Z Zou","year":"2010","unstructured":"Zou, Z., Li, J., Gao, H., Zhang, S.: Mining frequent subgraph patterns from uncertain graph data. IEEE Trans. Knowl. Data Eng. 22(9), 1203\u20131218 (2010)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"Z\u00fcfle, A., Emrich, T., Schmid, K.A., Mamoulis, N., Zimek, A., Renz, M.: Representative clustering of uncertain data. In: KDD, pp. 243\u2013252 (2014)","DOI":"10.1145\/2623330.2623725"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-32049-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T18:00:12Z","timestamp":1559412012000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-32049-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319320489","9783319320496"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-32049-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}