{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:38:30Z","timestamp":1750307910835,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,3,11]],"date-time":"2007-03-11T00:00:00Z","timestamp":1173571200000},"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":[[2007,3,11]]},"DOI":"10.1145\/1244002.1244099","type":"proceedings-article","created":{"date-parts":[[2007,6,6]],"date-time":"2007-06-06T14:37:31Z","timestamp":1181140651000},"page":"417-422","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["FAT-miner"],"prefix":"10.1145","author":[{"given":"Jeroen","family":"De Knijf","sequence":"first","affiliation":[{"name":"Utrecht University, Utrecht, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,3,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/645920.672836"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972726.10"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276313"},{"volume-title":"Workshop notes on Discovery Challenge PKDD2000","author":"Berka P.","key":"e_1_3_2_1_4_1"},{"key":"e_1_3_2_1_5_1","unstructured":"Y. Chi R. Muntz S. Nijssen and J. Kok. Frequent subtree mining - an overview. Fundamenta Informaticae. 66(1--2):161--198 2005.   Y. Chi R. Muntz S. Nijssen and J. Kok. Frequent subtree mining - an overview. Fundamenta Informaticae . 66(1--2):161--198 2005."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/647997.742623"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1147197.1147210"},{"key":"e_1_3_2_1_8_1","first-page":"13","volume-title":"PKDD 2000","author":"Inokuchi A.","year":"2000"},{"volume-title":"Universiteit Utrecht","year":"2004","author":"Knobbe A.","key":"e_1_3_2_1_10_1"},{"key":"e_1_3_2_1_11_1","first-page":"322","volume-title":"ICDM 2002","author":"Ng E.","year":"2002"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.846290"},{"key":"e_1_3_2_1_13_1","first-page":"721","volume-title":"ICDM 2002","author":"Yan X.","year":"2002"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775058"}],"event":{"name":"SAC07: The 2007 ACM Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Seoul Korea","acronym":"SAC07"},"container-title":["Proceedings of the 2007 ACM symposium on Applied computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1244002.1244099","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1244002.1244099","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:47:50Z","timestamp":1750258070000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1244002.1244099"}},"subtitle":["mining frequent attribute trees"],"short-title":[],"issued":{"date-parts":[[2007,3,11]]},"references-count":13,"alternative-id":["10.1145\/1244002.1244099","10.1145\/1244002"],"URL":"https:\/\/doi.org\/10.1145\/1244002.1244099","relation":{},"subject":[],"published":{"date-parts":[[2007,3,11]]},"assertion":[{"value":"2007-03-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}