{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T04:16:11Z","timestamp":1752984971976,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,8,11]],"date-time":"2013-08-11T00:00:00Z","timestamp":1376179200000},"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":[[2013,8,11]]},"DOI":"10.1145\/2487575.2487602","type":"proceedings-article","created":{"date-parts":[[2013,8,13]],"date-time":"2013-08-13T12:31:21Z","timestamp":1376397081000},"page":"518-526","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["Approximate graph mining with label costs"],"prefix":"10.1145","author":[{"given":"Pranay","family":"Anchuri","sequence":"first","affiliation":[{"name":"RPI, Troy, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammed J.","family":"Zaki","sequence":"additional","affiliation":[{"name":"RPI, Troy, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Omer","family":"Barkol","sequence":"additional","affiliation":[{"name":"HP Labs, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shahar","family":"Golan","sequence":"additional","affiliation":[{"name":"HP Labs, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moshe","family":"Shamy","sequence":"additional","affiliation":[{"name":"HP Software, Yahud, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,8,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33275-3_39"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-012-0528-3"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1786574.1786663"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1002\/sam.v1:2"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2007.36"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/bf01580113"},{"key":"e_1_3_2_1_7_1","volume-title":"Int'l Workshop on Mining and Learning with Graphs","author":"Fiedler M.","year":"2007","unstructured":"M. Fiedler and C. Borgelt . Support computation for mining frequent subgraphs in a single graph . In Int'l Workshop on Mining and Learning with Graphs , 2007 . M. Fiedler and C. Borgelt. Support computation for mining frequent subgraphs in a single graph. In Int'l Workshop on Mining and Learning with Graphs, 2007."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2005.138"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687710"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.89.22.10915"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/951949.952101"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021726221443"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-010-0376-y"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/645496.658027"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-005-0003-9"},{"key":"e_1_3_2_1_17_1","volume-title":"Congressus Numerantium, 30: 45--87","author":"McKay B. D.","year":"1981","unstructured":"B. D. McKay . Practical graph isomorphism . Congressus Numerantium, 30: 45--87 , 1981 . B. D. McKay. Practical graph isomorphism. Congressus Numerantium, 30:45--87, 1981."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497505"},{"key":"e_1_3_2_1_19_1","volume-title":"ICDM Conference","author":"Yan X.","year":"2002","unstructured":"X. Yan and J. Han . gSpan: Graph-based substructure pattern mining . In ICDM Conference , 2002 . X. Yan and J. Han. gSpan: Graph-based substructure pattern mining. In ICDM Conference, 2002."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69497-7_14"}],"event":{"name":"KDD' 13: The 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Chicago Illinois USA","acronym":"KDD' 13"},"container-title":["Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2487575.2487602","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2487575.2487602","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:35:55Z","timestamp":1750235755000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2487575.2487602"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,11]]},"references-count":20,"alternative-id":["10.1145\/2487575.2487602","10.1145\/2487575"],"URL":"https:\/\/doi.org\/10.1145\/2487575.2487602","relation":{},"subject":[],"published":{"date-parts":[[2013,8,11]]},"assertion":[{"value":"2013-08-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}