{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:56:23Z","timestamp":1750308983889,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,6,13]],"date-time":"2004-06-13T00:00:00Z","timestamp":1087084800000},"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":[[2004,6,13]]},"DOI":"10.1145\/1008694.1008702","type":"proceedings-article","created":{"date-parts":[[2004,7,20]],"date-time":"2004-07-20T15:55:38Z","timestamp":1090338938000},"page":"51-58","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Diagonally Subgraphs Pattern Mining"],"prefix":"10.1145","author":[{"given":"Moti","family":"Cohen","sequence":"first","affiliation":[{"name":"Ben-Gurion University, Beer-Sheva, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ehud","family":"Gudes","sequence":"additional","affiliation":[{"name":"Ben-Gurion University, Beer-Sheva, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2004,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"A. Inokuchi T. Washio and H. M. Otoda. An Apriori-based algorithm for mining frequent substructures from graph data. In PKDD'00.]]   A. Inokuchi T. Washio and H. M. Otoda. An Apriori-based algorithm for mining frequent substructures from graph data. In PKDD'00.]]"},{"key":"e_1_3_2_1_2_1","volume-title":"An efficient algorithm for discovering frequent subgraphs. Technical report","author":"Kuramochi Michihiro","year":"2002","unstructured":"Michihiro Kuramochi and George Karypis . An efficient algorithm for discovering frequent subgraphs. Technical report , 2002 . http:\/\/www.cs.umn.edu\/~kuram\/papers\/fsg-long.pdf.]] Michihiro Kuramochi and George Karypis. An efficient algorithm for discovering frequent subgraphs. Technical report, 2002. http:\/\/www.cs.umn.edu\/~kuram\/papers\/fsg-long.pdf.]]"},{"volume-title":"ICDM'02","author":"Vanetik N.","key":"e_1_3_2_1_3_1","unstructured":"N. Vanetik , E. Gudes , and S. E. Shimony . Computing frequent graph patterns from semistructured data . In ICDM'02 .]] N. Vanetik, E. Gudes, and S. E. Shimony. Computing frequent graph patterns from semistructured data. In ICDM'02.]]"},{"volume-title":"ICDM'02","author":"Borgelt C.","key":"e_1_3_2_1_4_1","unstructured":"C. Borgelt and M. R. Berthold . Mining molecular fragments: Finging relevant substructures of molecules . In ICDM'02 .]] C. Borgelt and M. R. Berthold. Mining molecular fragments: Finging relevant substructures of molecules. In ICDM'02.]]"},{"key":"e_1_3_2_1_5_1","first-page":"4","author":"Yan X.","year":"2002","unstructured":"X. Yan , J. Han. gSpan: Graph-based substructure pattern mining. UIUC-CS Tech. Report: R- 2002 --2296 (a 4 -page short version in ICDM'02).]] X. Yan, J. Han. gSpan: Graph-based substructure pattern mining. UIUC-CS Tech. Report: R-2002--2296 (a 4-page short version in ICDM'02).]]","journal-title":"J. Han. gSpan: Graph-based substructure pattern mining. UIUC-CS Tech. Report: R-"},{"volume-title":"Jan Prins. Efficient Mining of Frequent Subgraphs in the Presence of Isomorphism. In. ICDM'03","author":"Huan Jun","key":"e_1_3_2_1_6_1","unstructured":"Jun Huan , Wei Wang , Jan Prins. Efficient Mining of Frequent Subgraphs in the Presence of Isomorphism. In. ICDM'03 .]] Jun Huan, Wei Wang, Jan Prins. Efficient Mining of Frequent Subgraphs in the Presence of Isomorphism. In. ICDM'03.]]"},{"key":"e_1_3_2_1_7_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2001","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to Algorithms . MIT Press , 2001 , Second Edition.]] T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, 2001, Second Edition.]]"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775058"},{"key":"e_1_3_2_1_9_1","unstructured":"R. Goldman and J. Widom. Dataguides: Enabling query formulation and optimization in semistructured databases. In VLDB'97.]]   R. Goldman and J. Widom. Dataguides: Enabling query formulation and optimization in semistructured databases. In VLDB'97.]]"},{"key":"e_1_3_2_1_10_1","first-page":"487","volume-title":"VLDB'94","author":"Agrawal R.","year":"1994","unstructured":"R. Agrawal and R. Srikant . Fast algorithms for mining association rules . In VLDB'94 , pages 487 -- 499 , Sept. 1994 .]] R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In VLDB'94, pages 487--499, Sept. 1994.]]"},{"volume-title":"Mining Frequent Labeled and Partially Labeled Graph Patterns. In ICDE'04","author":"Vanetik N.","key":"e_1_3_2_1_11_1","unstructured":"N. Vanetik , E. Gudes . Mining Frequent Labeled and Partially Labeled Graph Patterns. In ICDE'04 .]] N. Vanetik, E. Gudes. Mining Frequent Labeled and Partially Labeled Graph Patterns. In ICDE'04.]]"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.32"},{"key":"e_1_3_2_1_13_1","volume-title":"Morgan Kaufman Publications","author":"Han Jiawei","year":"2001","unstructured":"Jiawei Han and Micheline Kamber , \" Data mining Concepts and Techniques\" , Morgan Kaufman Publications , 2001 ]] Jiawei Han and Micheline Kamber, \"Data mining Concepts and Techniques\", Morgan Kaufman Publications, 2001]]"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/645484.656386"}],"event":{"name":"DMKD04: 9th ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery 2004","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Paris France","acronym":"DMKD04"},"container-title":["Proceedings of the 9th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1008694.1008702","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1008694.1008702","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:41:07Z","timestamp":1750282867000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1008694.1008702"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,6,13]]},"references-count":14,"alternative-id":["10.1145\/1008694.1008702","10.1145\/1008694"],"URL":"https:\/\/doi.org\/10.1145\/1008694.1008702","relation":{},"subject":[],"published":{"date-parts":[[2004,6,13]]},"assertion":[{"value":"2004-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}