{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:31:35Z","timestamp":1750307495904,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,10,30]],"date-time":"2010-10-30T00:00:00Z","timestamp":1288396800000},"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":[[2010,10,30]]},"DOI":"10.1145\/1871902.1871906","type":"proceedings-article","created":{"date-parts":[[2010,11,1]],"date-time":"2010-11-01T13:32:23Z","timestamp":1288618343000},"page":"17-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Efficient algorithms based on relational queries to mine frequent graphs"],"prefix":"10.1145","author":[{"given":"Walter","family":"Garcia","sequence":"first","affiliation":[{"name":"University of Houston - Downtown, Houston, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos","family":"Ordonez","sequence":"additional","affiliation":[{"name":"University of Houston, Houston, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Zhao","sequence":"additional","affiliation":[{"name":"University of Houston, Houston, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ping","family":"Chen","sequence":"additional","affiliation":[{"name":"University of Houston - Downtown, Houston, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,10,30]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"487","volume-title":"VLDB Conference","author":"Agrawal R.","year":"1994","unstructured":"R. Agrawal and R. Srikant . Fast algorithms for mining association rules in large databases . In VLDB Conference , pages 487 -- 499 , 1994 . R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In VLDB Conference, pages 487--499, 1994."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/11731139_77"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24775-3_42"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559989"},{"key":"e_1_3_2_1_5_1","volume-title":"Substructure discovery using minimum description length and background knowledge. J. Artif. Intell. Res. (JAIR), 1:231--255","author":"Cook D. J.","year":"1994","unstructured":"D. J. Cook and L. B. Holder . Substructure discovery using minimum description length and background knowledge. J. Artif. Intell. Res. (JAIR), 1:231--255 , 1994 . D. J. Cook and L. B. Holder. Substructure discovery using minimum description length and background knowledge. J. Artif. Intell. Res. (JAIR), 1:231--255, 1994."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009863704807"},{"key":"e_1_3_2_1_7_1","volume-title":"Computers and Intractability","author":"Garey M. R.","year":"1990","unstructured":"M. R. Garey and D. S. Johnson . Computers and Intractability ; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co. , New York, NY, USA, 1990 . M. R. Garey and D. S. Johnson. Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA, 1990."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/645804.669817"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/645496.658027"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1551582.1551590"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TITB.2008.926989"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2008.47"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376662"},{"key":"e_1_3_2_1_14_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_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00872095"}],"event":{"name":"CIKM '10: International Conference on Information and Knowledge Management","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Toronto ON Canada","acronym":"CIKM '10"},"container-title":["Proceedings of the 3rd workshop on Ph.D. students in information and knowledge management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1871902.1871906","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1871902.1871906","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:17:39Z","timestamp":1750249059000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1871902.1871906"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,30]]},"references-count":15,"alternative-id":["10.1145\/1871902.1871906","10.1145\/1871902"],"URL":"https:\/\/doi.org\/10.1145\/1871902.1871906","relation":{},"subject":[],"published":{"date-parts":[[2010,10,30]]},"assertion":[{"value":"2010-10-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}