{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:10:40Z","timestamp":1750306240095,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,1,5]],"date-time":"2017-01-05T00:00:00Z","timestamp":1483574400000},"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":[[2017,1,5]]},"DOI":"10.1145\/3022227.3022242","type":"proceedings-article","created":{"date-parts":[[2017,2,10]],"date-time":"2017-02-10T13:39:43Z","timestamp":1486733983000},"page":"1-7","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Top-k frequent induced subgraph mining on a sliding window using sampling"],"prefix":"10.1145","author":[{"given":"Van T. T.","family":"Duong","sequence":"first","affiliation":[{"name":"Kyung Hee University, Yongin-si, Republic of Korea"}]},{"given":"Kifayat Ullah","family":"Khan","sequence":"additional","affiliation":[{"name":"Kyung Hee University, Yongin-si, Republic of Korea"}]},{"given":"Young-Koo","family":"Lee","sequence":"additional","affiliation":[{"name":"Kyung Hee University, Yongin-si, Republic of Korea"}]}],"member":"320","published-online":{"date-parts":[[2017,1,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-006-0059-1"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/645496.658027"},{"key":"e_1_3_2_1_3_1","first-page":"721","volume-title":"ICDM 2003. Proceedings. 2002 IEEE Int. Conf. on.","volume":"1","author":"Yan X.","year":"2002","unstructured":"X. Yan and J. Han , \" gSpan: Graph-Based Substructure Pattern Mining,\" Data Mining, 2002 . ICDM 2003. Proceedings. 2002 IEEE Int. Conf. on. , vol. 1 , no. d, pp. 721 -- 724 , 2002 . X. Yan and J. Han, \"gSpan: Graph-Based Substructure Pattern Mining,\" Data Mining, 2002. ICDM 2003. Proceedings. 2002 IEEE Int. Conf. on., vol. 1, no. d, pp. 721--724, 2002."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2004.12.039"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401897"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2684822.2685323"},{"issue":"1","key":"e_1_3_2_1_7_1","first-page":"1","article-title":"An apriori-based algorithm for mining frequent substructures from graph data","volume":"13","author":"Peyton Jones S.","year":"2003","unstructured":"S. Peyton Jones , \" An apriori-based algorithm for mining frequent substructures from graph data ,\" J. Funct. Program. , vol. 13 , no. 1 , pp. 1 -- 15 , 2003 . S. Peyton Jones, \"An apriori-based algorithm for mining frequent substructures from graph data,\" J. Funct. Program., vol. 13, no. 1, pp. 1--15, 2003.","journal-title":"J. Funct. Program."},{"key":"e_1_3_2_1_8_1","first-page":"520","article-title":"Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth","volume":"5211","author":"Horvath T.","year":"2010","unstructured":"T. Horvath and J. Ramon , \" Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth ,\" Theor. Comput. Sci , vol. 5211 , pp. 520 -- 535 , 2010 . T. Horvath and J. Ramon, \"Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth,\" Theor. Comput. Sci, vol. 5211, pp. 520--535, 2010.","journal-title":"Theor. Comput. Sci"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"A. Inokuchi \"Mining Frequent Graph Sequence Patterns Induced by Vertices \" pp. 466--477. A. Inokuchi \"Mining Frequent Graph Sequence Patterns Induced by Vertices \" pp. 466--477.","DOI":"10.1137\/1.9781611972801.41"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-14142-8","volume-title":"Data mining: The Textbook","author":"Aggarwal C. C.","year":"2015","unstructured":"C. C. Aggarwal , Data mining: The Textbook . Springer , 2015 . C. C. Aggarwal, Data mining: The Textbook. Springer, 2015."},{"key":"e_1_3_2_1_11_1","first-page":"72","volume-title":"Conf. Big Data, IEEE Big Data 2014","author":"Saha T. K.","year":"2015","unstructured":"T. K. Saha and M. Al Hasan , \" FS3: A sampling based method for top-k frequent subgraph mining,\" Proc. - 2014 IEEE Int . Conf. Big Data, IEEE Big Data 2014 , pp. 72 -- 79 , 2015 . T. K. Saha and M. Al Hasan, \"FS3: A sampling based method for top-k frequent subgraph mining,\" Proc. - 2014 IEEE Int. Conf. Big Data, IEEE Big Data 2014, pp. 72--79, 2015."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020501"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2015.08.184"},{"key":"e_1_3_2_1_14_1","unstructured":"\"Weisstein Eric W. 'Vertex-Induced Subgraph.' From MathWorld-A Wolfram Web Resource. http:\/\/mathworld.wolfram.com\/Vertex-InducedSubgraph.html.\". \"Weisstein Eric W. 'Vertex-Induced Subgraph.' From MathWorld-A Wolfram Web Resource. http:\/\/mathworld.wolfram.com\/Vertex-InducedSubgraph.html.\"."},{"key":"e_1_3_2_1_15_1","article-title":"Enron Email Dataset","author":"Tobergte D. R.","year":"2013","unstructured":"D. R. Tobergte and S. Curtis , \" Enron Email Dataset ,\" Journal of Chemical Information and Modeling , 2013 . . D. R. Tobergte and S. Curtis, \"Enron Email Dataset,\" Journal of Chemical Information and Modeling, 2013. .","journal-title":"Journal of Chemical Information and Modeling"}],"event":{"name":"IMCOM '17: The 11th International Conference on Ubiquitous Information Management and Communication","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Beppu Japan","acronym":"IMCOM '17"},"container-title":["Proceedings of the 11th International Conference on Ubiquitous Information Management and Communication"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3022227.3022242","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3022227.3022242","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:23:32Z","timestamp":1750220612000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3022227.3022242"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,5]]},"references-count":15,"alternative-id":["10.1145\/3022227.3022242","10.1145\/3022227"],"URL":"https:\/\/doi.org\/10.1145\/3022227.3022242","relation":{},"subject":[],"published":{"date-parts":[[2017,1,5]]},"assertion":[{"value":"2017-01-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}