{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:32:04Z","timestamp":1750221124812,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T00:00:00Z","timestamp":1561420800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001459","name":"Ministry of Education - Singapore","doi-asserted-by":"publisher","award":["MOE2015-T2-1-040"],"award-info":[{"award-number":["MOE2015-T2-1-040"]}],"id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,25]]},"DOI":"10.1145\/3299869.3300072","type":"proceedings-article","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T17:41:43Z","timestamp":1560879703000},"page":"900-917","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["CATAPULT"],"prefix":"10.1145","author":[{"given":"Kai","family":"Huang","sequence":"first","affiliation":[{"name":"Fudan University, Shanghai, China"}]},{"given":"Huey Eng","family":"Chua","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}]},{"given":"Sourav S.","family":"Bhowmick","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}]},{"given":"Byron","family":"Choi","sequence":"additional","affiliation":[{"name":"Hong Kong Baptist University, Hong Kong, Hong Kong"}]},{"given":"Shuigeng","family":"Zhou","sequence":"additional","affiliation":[{"name":"Fudan University, Shanghai, China"}]}],"member":"320","published-online":{"date-parts":[[2019,6,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/578775"},{"key":"e_1_3_2_1_2_1","volume-title":"The multiplicative weights update method: a meta-algorithm and applications. Theory Comput. 8(1)","author":"Arora S.","year":"2012","unstructured":"S. Arora , E. Hazan , S. Kale . The multiplicative weights update method: a meta-algorithm and applications. Theory Comput. 8(1) , 2012 . S. Arora, E. Hazan, S. Kale. The multiplicative weights update method: a meta-algorithm and applications. Theory Comput. 8(1), 2012."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1137856.1137880"},{"key":"e_1_3_2_1_4_1","volume-title":"k-means++: The advantages of careful seeding","author":"Arthur D.","year":"2007","unstructured":"D. Arthur , S. Vassilvitskii . k-means++: The advantages of careful seeding . In SIAM , 2007 . D. Arthur, S. Vassilvitskii. k-means++: The advantages of careful seeding. In SIAM, 2007."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.14778\/2180912.2180915"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994517"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(97)00060-3"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1002\/asia.200700182"},{"key":"e_1_3_2_1_9_1","volume-title":"Canonical forms for labelled trees and their applications in frequent subtree mining. Knowl. Inf. Syst., 8(2)","author":"Chi Y.","year":"2005","unstructured":"Y. Chi , Canonical forms for labelled trees and their applications in frequent subtree mining. Knowl. Inf. Syst., 8(2) , 2005 . Y. Chi, et al. Canonical forms for labelled trees and their applications in frequent subtree mining. Knowl. Inf. Syst., 8(2), 2005."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/951949.952084"},{"key":"e_1_3_2_1_11_1","unstructured":"W.G. Cochran. Sampling techniques. Third edition. Wiley New York New York USA.  W.G. Cochran. Sampling techniques. Third edition. Wiley New York New York USA."},{"key":"e_1_3_2_1_12_1","volume-title":"Evolutionary algorithms for solving multi-objective problems","author":"Coello C","year":"2007","unstructured":"C.A. C Coello , G.B. Lamont , D.A. Van Veldhuizen . Evolutionary algorithms for solving multi-objective problems . 2 nd Edition, Springer , 2007 . C.A.C Coello, G.B. Lamont, D.A. Van Veldhuizen. Evolutionary algorithms for solving multi-objective problems. 2nd Edition, Springer, 2007.","edition":"2"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00139"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.75"},{"key":"e_1_3_2_1_15_1","volume-title":"Instruments, & Computers, 35(3)","author":"Laura Faulkner L.","year":"2003","unstructured":"L. Laura Faulkner . Beyond the five-user assumption: Benefits of increased sample sizes in usability testing. Behavior Research Methods , Instruments, & Computers, 35(3) , 2003 . L. Laura Faulkner. Beyond the five-user assumption: Benefits of increased sample sizes in usability testing. Behavior Research Methods, Instruments, & Computers, 35(3), 2003."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1316689.1316738"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102385"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(01)00173-8"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.37"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1057\/ivs.2009.10"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/375827.375845"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.3390\/molecules21111572"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00031-9"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45803-7_20"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/1841406"},{"issue":"1","key":"e_1_3_2_1_27_1","first-page":"29","article-title":"Backtrack search algorithms and the maximal common subgraph problem. Software","volume":"12","author":"McGregor J.J.","year":"1982","unstructured":"J.J. McGregor . Backtrack search algorithms and the maximal common subgraph problem. Software : Practice and Experience , 12 ( 1 ): 29 -- 34 , 1982 . J.J. McGregor. Backtrack search algorithms and the maximal common subgraph problem. Software: Practice and Experience, 12(1):29--34, 1982.","journal-title":"Practice and Experience"},{"issue":"2","key":"e_1_3_2_1_28_1","first-page":"239","article-title":"Comparison of three methods for selecting values of input variables in the analysis of output from a computer code","volume":"21","author":"McKay M.D.","year":"1979","unstructured":"M.D. McKay , R. J Beckman , W.J. Conover . Comparison of three methods for selecting values of input variables in the analysis of output from a computer code . Technometrics , 21 ( 2 ): 239 -- 245 , 1979 . M.D. McKay, R.J Beckman,W.J. Conover. Comparison of three methods for selecting values of input variables in the analysis of output from a computer code. Technometrics, 21(2):239--245, 1979.","journal-title":"Technometrics"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143923"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2004.12.039"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2015.03.198"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/1769371.1769373"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(02)00205-6"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2007.05.001"},{"key":"e_1_3_2_1_35_1","volume-title":"StruClus: structural clustering of large-scale graph databases. CoRR abs\/1609.09000","author":"Sch\u00e4fer T.","year":"2016","unstructured":"T. Sch\u00e4fer , P. Mutzel . StruClus: structural clustering of large-scale graph databases. CoRR abs\/1609.09000 , 2016 . T. Sch\u00e4fer, P. Mutzel. StruClus: structural clustering of large-scale graph databases. CoRR abs\/1609.09000, 2016."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807264"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/2875383.2875384"},{"key":"e_1_3_2_1_38_1","volume-title":"VLDB","author":"Toivonen H.","year":"1996","unstructured":"H. Toivonen . Sampling large databases for association rules . In VLDB , 1996 . H. Toivonen. Sampling large databases for association rules. In VLDB, 1996."},{"key":"e_1_3_2_1_39_1","volume-title":"Frequent subtree mining","author":"Chi Y.","year":"2005","unstructured":"Y. Chi , R.R. Muntz , S. Nijssen . Frequent subtree mining . In T. Washio, et al., editors, Advances in Mining Graphs, Trees and Sequences , 2005 . Y. Chi, R.R. Muntz, S. Nijssen. Frequent subtree mining. In T. Washio, et al., editors, Advances in Mining Graphs, Trees and Sequences, 2005."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113411"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3193570"}],"event":{"name":"SIGMOD\/PODS '19: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Amsterdam Netherlands","acronym":"SIGMOD\/PODS '19"},"container-title":["Proceedings of the 2019 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3299869.3300072","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3299869.3300072","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:16Z","timestamp":1750208536000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3299869.3300072"}},"subtitle":["Data-driven Selection of Canned Patterns for Efficient Visual Graph Query Formulation"],"short-title":[],"issued":{"date-parts":[[2019,6,25]]},"references-count":40,"alternative-id":["10.1145\/3299869.3300072","10.1145\/3299869"],"URL":"https:\/\/doi.org\/10.1145\/3299869.3300072","relation":{},"subject":[],"published":{"date-parts":[[2019,6,25]]},"assertion":[{"value":"2019-06-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}