{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T06:24:49Z","timestamp":1766298289244,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,3,21]],"date-time":"2011-03-21T00:00:00Z","timestamp":1300665600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,3,21]]},"DOI":"10.1145\/1951365.1951408","type":"proceedings-article","created":{"date-parts":[[2011,3,22]],"date-time":"2011-03-22T12:25:29Z","timestamp":1300796729000},"page":"355-366","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":38,"title":["Efficient discovery of frequent subgraph patterns in uncertain graph databases"],"prefix":"10.1145","author":[{"given":"Odysseas","family":"Papapetrou","sequence":"first","affiliation":[{"name":"L3S Research Center, Hannover, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ekaterini","family":"Ioannou","sequence":"additional","affiliation":[{"name":"L3S Research Center, Hannover, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitrios","family":"Skoutas","sequence":"additional","affiliation":[{"name":"L3S Research Center, Hannover, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,3,21]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"487","volume-title":"VLDB","author":"Agrawal R.","year":"1994","unstructured":"R. Agrawal and R. Srikant . Fast algorithms for mining association rules in large databases . In VLDB , pages 487 -- 499 , 1994 . R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In VLDB, pages 487--499, 1994."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1101\/gr.2203804"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_4_1","unstructured":"J. Cheng Y. Ke and W. Ng. Graphgen: A synthetic graph generator. http:\/\/www.cse.ust.hk\/graphgen\/ 2006.  J. Cheng Y. Ke and W. Ng. Graphgen: A synthetic graph generator. http:\/\/www.cse.ust.hk\/graphgen\/ 2006."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247574"},{"key":"e_1_3_2_1_6_1","first-page":"149","volume-title":"3rd IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition","author":"Cordella L. P.","year":"2001","unstructured":"L. P. Cordella , P. Foggia , C. Sansone , and M. Vento . An improved algorithm for matching large graphs . In 3rd IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition , pages 149 -- 159 , 2001 . L. P. Cordella, P. Foggia, C. Sansone, and M. Vento. An improved algorithm for matching large graphs. In 3rd IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, pages 149--159, 2001."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.201"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2006.173"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.37"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/17.1.107"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-008-0106-1"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1739041.1739084"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/951949.952101"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014123"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1289\/ehp.919623"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/645804.669817"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.33"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/956863.956972"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497499"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014134"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920967"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(79)90044-6"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014088"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/959242.959249"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376662"},{"key":"e_1_3_2_1_28_1","first-page":"721","volume-title":"ICDM","author":"Yan X.","year":"2002","unstructured":"X. Yan and J. Han . gspan: Graph-based substructure pattern mining . In ICDM , pages 721 -- 724 , 2002 . X. Yan and J. Han. gspan: Graph-based substructure pattern mining. In ICDM, pages 721--724, 2002."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956784"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007607"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.96"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646028"}],"event":{"name":"EDBT\/ICDT '11: EDBT\/ICDT '11 joint conference","sponsor":["Microsoft Research Microsoft Research"],"location":"Uppsala Sweden","acronym":"EDBT\/ICDT '11"},"container-title":["Proceedings of the 14th International Conference on Extending Database Technology"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1951365.1951408","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1951365.1951408","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:14Z","timestamp":1750243934000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1951365.1951408"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,21]]},"references-count":32,"alternative-id":["10.1145\/1951365.1951408","10.1145\/1951365"],"URL":"https:\/\/doi.org\/10.1145\/1951365.1951408","relation":{},"subject":[],"published":{"date-parts":[[2011,3,21]]},"assertion":[{"value":"2011-03-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}