{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T19:30:17Z","timestamp":1704137417633},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2015,7,5]],"date-time":"2015-07-05T00:00:00Z","timestamp":1436054400000},"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":["World Wide Web"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s11280-015-0358-9","type":"journal-article","created":{"date-parts":[[2015,7,4]],"date-time":"2015-07-04T08:46:12Z","timestamp":1435999572000},"page":"755-782","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Subgraph similarity maximal all-matching over a large uncertain graph"],"prefix":"10.1007","volume":"19","author":[{"given":"Yu","family":"Gu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunpeng","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lulu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ge","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,5]]},"reference":[{"issue":"2","key":"358_CR1","first-page":"15","volume":"30","author":"E Adar","year":"2007","unstructured":"Adar, E., Re, C.: Managing Uncertainty in Social Networks. IEEE Data Eng. Bull. 30(2), 15\u201322 (2007)","journal-title":"IEEE Data Eng. Bull."},{"key":"358_CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Wang, H.: Managing and Mining Graph Data, vol.40 of Advances in Database Systems. Springer (2010)","DOI":"10.1007\/978-1-4419-6045-0"},{"key":"358_CR3","doi-asserted-by":"publisher","unstructured":"Choi, R., Chung, C.-W.: Efficient processing of graph similarity search. WWW J. preprint, doi: 10.1007\/s11280-014-0274-4","DOI":"10.1007\/s11280-014-0274-4"},{"issue":"3","key":"358_CR4","first-page":"265","volume":"18","author":"D Conte","year":"2004","unstructured":"Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty Years Of Graph Matching In Pattern Recognition. IJPRAI 18(3), 265\u2013298 (2004)","journal-title":"IJPRAI"},{"issue":"10","key":"358_CR5","doi-asserted-by":"crossref","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"LP Cordella","year":"2004","unstructured":"Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs. IEEE Trans. Pattern Anal. Mach. Intell. 26(10), 1367\u20131372 (2004)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"5","key":"358_CR6","doi-asserted-by":"crossref","first-page":"1117","DOI":"10.1109\/TKDE.2013.123","volume":"26","author":"Y Gu","year":"2014","unstructured":"Gu, Y., Gao, C., Cong, G., Yu, G.: Effective and Efficient Clustering Methods for Correlated Probabilistic Graphs. IEEE Trans. Knowl. Data Eng. 26(5), 1117\u20131130 (2014)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"358_CR7","doi-asserted-by":"crossref","unstructured":"Hua, M., Pei, J.: Probabilistic path queries in road networks: traffic uncertainty aware path selection. In: Proceedings of EDBT, pp 347\u2013358 (2010)","DOI":"10.1145\/1739041.1739084"},{"key":"358_CR8","doi-asserted-by":"crossref","unstructured":"Jiang, H., Wang, H., Yu, P.S., Zhou, S.: GString: A Novel Approach for Efficient Search in Graph Databases. In: Proceedings of ICDE, pp 566\u2013575 (2007)","DOI":"10.1109\/ICDE.2007.367902"},{"key":"358_CR9","doi-asserted-by":"crossref","unstructured":"Jin, R., Liu, L., Aggarwal, C.C.: Discovering highly reliable subgraphs in uncertain graphs. In: Proceedings of KDD, pp. 992\u20131000 (2011)","DOI":"10.1145\/2020408.2020569"},{"issue":"9","key":"358_CR10","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"},{"issue":"2","key":"358_CR11","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1109\/TKDE.2011.243","volume":"25","author":"G Kollios","year":"2011","unstructured":"Kollios, G., Potamias, M., Terzi, E.: Clustering Large Probabilistic Graphs. IEEE Trans. Knowl. Data Eng. 25(2), 325\u2013336 (2011)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"4","key":"358_CR12","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1017\/S0960129501003577","volume":"12","author":"J Larrosa","year":"2002","unstructured":"Larrosa, J., Valiente, G.: Constraint Satisfaction Algorithms for Graph Pattern Matching. Math. Struct. Comput. Sci. 12(4), 403\u2013422 (2002)","journal-title":"Math. Struct. Comput. Sci."},{"issue":"1","key":"358_CR13","first-page":"161","volume":"17","author":"Z Liu","year":"2014","unstructured":"Liu, Z., Wang, C., Wang, J.: Aggregate nearest neighbor queries in uncertain graphs. WWW J. 17(1), 161\u2013188 (2014)","journal-title":"WWW J."},{"issue":"6","key":"358_CR14","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1007\/s00778-012-0268-8","volume":"21","author":"J Li","year":"2012","unstructured":"Li, J., Zou, Z., Gao, H.: Mining frequent subgraphs over uncertain graph databases under probabilistic semantics. VLDB J. 21(6), 753\u2013777 (2012)","journal-title":"VLDB J."},{"issue":"1","key":"358_CR15","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"},{"issue":"1","key":"358_CR16","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"JR Ullmann","year":"1976","unstructured":"Ullmann, J.R.: An Algorithm for Subgraph Isomorphism. J. ACM 23(1), 31\u201342 (1976)","journal-title":"J. ACM"},{"key":"358_CR17","doi-asserted-by":"crossref","unstructured":"Wang, X., Smalter, A.M., Huan, J., Lushington, G.H.: G-hash: towards fast kernel-based similarity search in large graph databases. In: Proceedings of EDBT, pp 472\u2013480 (2009)","DOI":"10.1145\/1516360.1516416"},{"key":"358_CR18","doi-asserted-by":"publisher","unstructured":"Wang, Y., Wang, H., Li, J., Gao, H.: Efficient subgraph join based on connectivity similarity. WWW J. preprint, doi: 10.1007\/s11280-014-0286-0","DOI":"10.1007\/s11280-014-0286-0"},{"issue":"9","key":"358_CR19","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 Probabilisti Graph Databases. PVLDB 5(9), 800\u2013811 (2012)","journal-title":"PVLDB"},{"issue":"11","key":"358_CR20","first-page":"876","volume":"4","author":"Y Yuan","year":"2011","unstructured":"Yuan, Y., Wang, G., Wang, H., Chen, L.: Efficient Subgraph Search over Large Uncertain Graphs. PVLDB 4(11), 876\u2013886 (2011)","journal-title":"PVLDB"},{"key":"358_CR21","doi-asserted-by":"crossref","unstructured":"Zhu, G., Lin, X., Zhu, K., Zhang, W., Yu, J.X.: TreeSpan: efficiently computing similarity all-matching. In: Proceedings of SIGMOD, pp. 529\u2013540 (2012)","DOI":"10.1145\/2213836.2213896"},{"issue":"1","key":"358_CR22","first-page":"1185","volume":"3","author":"S Zhang","year":"2010","unstructured":"Zhang, S., Yang, J., Jin, W.: SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs. PVLDB 3(1), 1185\u20131194 (2010)","journal-title":"PVLDB"},{"key":"358_CR23","doi-asserted-by":"crossref","unstructured":"Zou, Z., Gao, H., Li, J.: Discovering frequent subgraphs over uncertain graph databases under probabilistic semantics. In: Proceedings of KDD, pp 633\u2013642 (2010)","DOI":"10.1145\/1835804.1835885"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-015-0358-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11280-015-0358-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-015-0358-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,28]],"date-time":"2019-08-28T00:00:04Z","timestamp":1566950404000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11280-015-0358-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,5]]},"references-count":23,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["358"],"URL":"https:\/\/doi.org\/10.1007\/s11280-015-0358-9","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"value":"1386-145X","type":"print"},{"value":"1573-1413","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,5]]}}}