{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T11:45:23Z","timestamp":1773834323080,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540220640","type":"print"},{"value":"9783540247753","type":"electronic"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24775-3_19","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T19:48:20Z","timestamp":1284148100000},"page":"155-160","source":"Crossref","is-referenced-by-count":29,"title":["FP-Bonsai: The Art of Growing and Pruning Small FP-Trees"],"prefix":"10.1007","author":[{"given":"Francesco","family":"Bonchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bart","family":"Goethals","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","unstructured":"Bonchi, F., Giannotti, F., Mazzanti, A., Pedreschi, D.: ExAMiner: Optimized level-wise frequent pattern mining with monotone constraints. In: Proc. of ICDM 2003 (2003)"},{"key":"19_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-540-39804-2_8","volume-title":"Knowledge Discovery in Databases: PKDD 2003","author":"F. Bonchi","year":"2003","unstructured":"Bonchi, F., Giannotti, F., Mazzanti, A., Pedreschi, D.: Exante: Anticipated data reduction in constrained pattern mining. In: Lavra\u010d, N., Gamberger, D., Todorovski, L., Blockeel, H. (eds.) PKDD 2003. LNCS (LNAI), vol.\u00a02838, pp. 59\u201370. Springer, Heidelberg (2003)"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Bucila, C., Gehrke, J., Kifer, D., White, W.: DualMiner: A dual-pruning algorithm for itemsets with constraints. In: Proc. of ACM SIGKDD 2002 (2002)","DOI":"10.1145\/775047.775054"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proc of ACM SIGMOD 2000 (2000)","DOI":"10.1145\/342009.335372"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Ng, R.T., Lakshmanan, L.V.S., Han, J., Pang, A.: Exploratory mining and pruning optimizations of constrained associations rules. In: Proc. of ACM SIGMOD 1998 (1998)","DOI":"10.1145\/276304.276307"},{"key":"19_CR6","unstructured":"Pei, J., Han, J., Lakshmanan, L.V.S.: Mining frequent item sets with convertible constraints. In: Proc. of ICDE 2001 (2001)"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24775-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T18:05:53Z","timestamp":1558289153000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24775-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540220640","9783540247753"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24775-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}