{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T11:11:04Z","timestamp":1730200264394,"version":"3.28.0"},"reference-count":38,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1109\/bigdata.2018.8622126","type":"proceedings-article","created":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T03:07:18Z","timestamp":1548385638000},"page":"703-712","source":"Crossref","is-referenced-by-count":5,"title":["An Efficient System for Subgraph Discovery"],"prefix":"10.1109","author":[{"given":"Aparna","family":"Joshi","sequence":"first","affiliation":[]},{"given":"Yu","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Petko","family":"Bogdanov","sequence":"additional","affiliation":[]},{"given":"Jeong-Hyon","family":"Hwang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/1391729.1391730"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113345"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498307"},{"key":"ref31","first-page":"697","article-title":"Ontology-based Subgraph Querying","author":"wu","year":"2013","journal-title":"ICDE"},{"article-title":"The NBER Patent Citation Data File: Lessons, Insights and Methodological Tools","year":"2011","author":"hall","key":"ref30"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2017.103"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.101"},{"key":"ref35","first-page":"525","article-title":"As Strong as the Weakest Link: Mining Diverse Cliques in Weighted Graphs","author":"bogdanov","year":"2013","journal-title":"ECML\/PKDD (1)"},{"key":"ref34","first-page":"259","article-title":"Mining Frequent Neighborhood Patterns in a Large Labeled Graph","author":"han","year":"2013","journal-title":"CIKM"},{"key":"ref10","first-page":"807","article-title":"Mining Top-K Large Structural Patterns in a Massive Network","volume":"4","author":"feida","year":"2011","journal-title":"PVLDB"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(90)90057-C"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.09.064"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/362342.362367"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339724"},{"key":"ref15","first-page":"1003","article-title":"A Local Algorithm for Finding Dense Subgraphs","author":"andersen","year":"2008","journal-title":"SODA"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815410"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.14778\/2733004.2733058"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3190508.3190545"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68125-0_84"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1080\/19361610.2011.529413"},{"journal-title":"Algorithms and Data Structures The Basic Toolbox","year":"2008","author":"mehlhorn","key":"ref27"},{"key":"ref3","first-page":"95","article-title":"BotGrep: Finding P2P Bots with Structured Graph Analysis","author":"nagaraja","year":"2010","journal-title":"USENIX Security Symposium"},{"key":"ref6","first-page":"517","article-title":"Turboiso: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases","author":"han","year":"2014","journal-title":"PVLDB"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007607"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0693-z"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816703"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti1049"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.14778\/2732286.2732289"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijhcs.2006.08.009"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487581"},{"key":"ref21","first-page":"340","article-title":"GraphLab: A New Framework For Parallel Machine Learning","author":"low","year":"2010","journal-title":"UAI"},{"key":"ref24","first-page":"721","article-title":"gSpan: Graph-Based Substructure Pattern Mining","author":"yan","year":"2002","journal-title":"ICDM"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1316874.1316897"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8622126"}],"event":{"name":"2018 IEEE International Conference on Big Data (Big Data)","start":{"date-parts":[[2018,12,10]]},"location":"Seattle, WA, USA","end":{"date-parts":[[2018,12,13]]}},"container-title":["2018 IEEE International Conference on Big Data (Big Data)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8610059\/8621858\/08622126.pdf?arnumber=8622126","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T23:23:06Z","timestamp":1643239386000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8622126\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/bigdata.2018.8622126","relation":{},"subject":[],"published":{"date-parts":[[2018,12]]}}}