{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T18:55:33Z","timestamp":1771700133402,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,8,22]],"date-time":"2004-08-22T00:00:00Z","timestamp":1093132800000},"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,8,22]]},"DOI":"10.1145\/1014052.1014123","type":"proceedings-article","created":{"date-parts":[[2004,10,7]],"date-time":"2004-10-07T17:39:48Z","timestamp":1097170788000},"page":"581-586","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":206,"title":["SPIN"],"prefix":"10.1145","author":[{"given":"Jun","family":"Huan","sequence":"first","affiliation":[{"name":"University of North Carolina at Chapel Hill, Chapel Hill, NC"}]},{"given":"Wei","family":"Wang","sequence":"additional","affiliation":[{"name":"University of North Carolina at Chapel Hill, Chapel Hill, NC"}]},{"given":"Jan","family":"Prins","sequence":"additional","affiliation":[{"name":"University of North Carolina at Chapel Hill, Chapel Hill, NC"}]},{"given":"Jiong","family":"Yang","sequence":"additional","affiliation":[{"name":"University of Illinois, Urbana-Champaign, IL"}]}],"member":"320","published-online":{"date-parts":[[2004,8,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/645806.670165"},{"key":"e_1_3_2_1_2_1","volume-title":"Proc. International Conference on Data Mining'02","author":"Borgelt C.","unstructured":"C. Borgelt and M. R. Berhold . Mining molecular fragments: Finding relevant substructures of molecules . In Proc. International Conference on Data Mining'02 .]] C. Borgelt and M. R. Berhold. Mining molecular fragments: Finding relevant substructures of molecules. In Proc. International Conference on Data Mining'02.]]"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/645484.656386"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/951949.952084"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304220"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/645496.658047"},{"key":"e_1_3_2_1_7_1","volume-title":"2nd BIOKDD Workshop on Data Mining in Bioinformatics","author":"Hu J.","year":"2002","unstructured":"J. Hu , X. Shen , Y. Shao , C. Bystroff , and M. J. Zaki . Mining protein contact maps . 2nd BIOKDD Workshop on Data Mining in Bioinformatics , 2002 .]] J. Hu, X. Shen, Y. Shao, C. Bystroff, and M. J. Zaki. Mining protein contact maps. 2nd BIOKDD Workshop on Data Mining in Bioinformatics, 2002.]]"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/974614.974655"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/951949.952101"},{"key":"e_1_3_2_1_11_1","volume-title":"Pacific Symposium on Biocomputing","author":"Huan J.","year":"2004","unstructured":"J. Huan , W. Wang , A. Washington , J. Prins , and A. Tropsha . Accurately classify protein family based on coherrent subgraph mining . in Pacific Symposium on Biocomputing , 2004 .]] J. Huan, W. Wang, A. Washington, J. Prins, and A. Tropsha. Accurately classify protein family based on coherrent subgraph mining. in Pacific Symposium on Biocomputing, 2004.]]"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/645804.669817"},{"key":"e_1_3_2_1_13_1","volume-title":"Proc. International Conference on Data Mining'01","author":"Kuramochi M.","unstructured":"M. Kuramochi and G. Karypis . Frequent subgraph discovery . In Proc. International Conference on Data Mining'01 .]] M. Kuramochi and G. Karypis. Frequent subgraph discovery. In Proc. International Conference on Data Mining'01.]]"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.32"},{"key":"e_1_3_2_1_15_1","volume-title":"ICDM","author":"Pei J.","year":"2002","unstructured":"J. Pei , G. Dong , W. Zou , and J. Han . On computing condensed frequent pattern bases . ICDM , 2002 .]] J. Pei, G. Dong, W. Zou, and J. Han. On computing condensed frequent pattern bases. ICDM, 2002.]]"},{"key":"e_1_3_2_1_16_1","volume-title":"Proceedings of the IEEE Intl. Conference on Data Engineering","author":"Raghavan S.","year":"2003","unstructured":"S. Raghavan and H. Garcia-Molina . Representing web graphs . In Proceedings of the IEEE Intl. Conference on Data Engineering , 2003 .]] S. Raghavan and H. Garcia-Molina. Representing web graphs. In Proceedings of the IEEE Intl. Conference on Data Engineering, 2003.]]"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/977401.978141"},{"key":"e_1_3_2_1_18_1","volume-title":"Proc. International Conference on Data Mining'02","author":"Vanetik N.","year":"2002","unstructured":"N. Vanetik , E. Gudes , and E. Shimony . Computing frequent graph patterns from semi-structured data . Proc. International Conference on Data Mining'02 , 2002 .]] N. Vanetik, E. Gudes, and E. Shimony. Computing frequent graph patterns from semi-structured data. Proc. International Conference on Data Mining'02, 2002.]]"},{"key":"e_1_3_2_1_19_1","volume-title":"Proc. International Conference on Data Mining'02","author":"Yan X.","unstructured":"X. Yan and J. Han . gspan: Graph-based substructure pattern mining . In Proc. International Conference on Data Mining'02 .]] X. Yan and J. Han. gspan: Graph-based substructure pattern mining. In Proc. International Conference on Data Mining'02.]]"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956784"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007607"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775058"}],"event":{"name":"KDD04: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Seattle WA USA","acronym":"KDD04","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1014052.1014123","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1014052.1014123","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:31:25Z","timestamp":1750264285000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1014052.1014123"}},"subtitle":["mining maximal frequent subgraphs from graph databases"],"short-title":[],"issued":{"date-parts":[[2004,8,22]]},"references-count":21,"alternative-id":["10.1145\/1014052.1014123","10.1145\/1014052"],"URL":"https:\/\/doi.org\/10.1145\/1014052.1014123","relation":{},"subject":[],"published":{"date-parts":[[2004,8,22]]},"assertion":[{"value":"2004-08-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}