{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:32:29Z","timestamp":1750307549883,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,3,22]],"date-time":"2010-03-22T00:00:00Z","timestamp":1269216000000},"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,3,22]]},"DOI":"10.1145\/1774088.1774309","type":"proceedings-article","created":{"date-parts":[[2010,4,27]],"date-time":"2010-04-27T12:45:48Z","timestamp":1272372348000},"page":"1060-1064","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["A persistent HY-Tree to efficiently support itemset mining on large datasets"],"prefix":"10.1145","author":[{"given":"Elena","family":"Baralis","sequence":"first","affiliation":[{"name":"Politecnico di Torino, Torino, Italy"}]},{"given":"Tania","family":"Cerquitelli","sequence":"additional","affiliation":[{"name":"Politecnico di Torino, Torino, Italy"}]},{"given":"Silvia","family":"Chiusano","sequence":"additional","affiliation":[{"name":"Politecnico di Torino, Torino, Italy"}]}],"member":"320","published-online":{"date-parts":[[2010,3,22]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1007\/s10489-007-0099-2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1109\/69.250074"},{"key":"e_1_3_2_1_3_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 large databases . In VLDB '94 , pages 487 -- 499 , 1994 . R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In VLDB '94, pages 487--499, 1994."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1145\/1150402.1150416"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1145\/956750.956766"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1145\/1008694.1008706"},{"unstructured":"FIMI. http:\/\/fimi.cs.helsinki.fi\/.  FIMI. http:\/\/fimi.cs.helsinki.fi\/.","key":"e_1_3_2_1_7_1"},{"key":"e_1_3_2_1_8_1","volume-title":"FIMI '04","author":"Grahne G.","year":"2003","unstructured":"G. Grahne and J. Zhu . Efficiently using prefix-trees in mining frequent itemsets . In FIMI '04 , 2003 . G. Grahne and J. Zhu. Efficiently using prefix-trees in mining frequent itemsets. In FIMI '04, 2003."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.5555\/1032649.1033441"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/342009.335372"},{"key":"e_1_3_2_1_11_1","volume-title":"FIMI '03","author":"Pietracaprina A.","year":"2003","unstructured":"A. Pietracaprina and D. Zandolin . Mining frequent itemsets using patricia tries . In FIMI '03 , 2003 . A. Pietracaprina and D. Zandolin. Mining frequent itemsets using patricia tries. In FIMI '03, 2003."},{"key":"e_1_3_2_1_12_1","volume-title":"FIMI '04","author":"R\u00e1cz B.","year":"2004","unstructured":"B. R\u00e1cz . nonordfp : An FP-growth variation without rebuilding the FP-tree . In FIMI '04 , 2004 . B. R\u00e1cz. nonordfp: An FP-growth variation without rebuilding the FP-tree. In FIMI '04, 2004."},{"key":"e_1_3_2_1_13_1","volume-title":"DMKD","author":"Ramesh G.","year":"2002","unstructured":"G. Ramesh , W. Maniatty , and M. J. Zaki . Indexing and data access methods for database mining . In DMKD , 2002 . G. Ramesh, W. Maniatty, and M. J. Zaki. Indexing and data access methods for database mining. In DMKD, 2002."},{"key":"e_1_3_2_1_14_1","volume-title":"FIMI '04","author":"Uno T.","year":"2004","unstructured":"T. Uno , M. Kiyomi , and H. Arimura . LCM ver. 2: Efficient mining algorithms for frequent\/closed\/maximal itemsets . In FIMI '04 , 2004 . T. Uno, M. Kiyomi, and H. Arimura. LCM ver. 2: Efficient mining algorithms for frequent\/closed\/maximal itemsets. In FIMI '04, 2004."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1145\/956750.956779"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1109\/69.846291"}],"event":{"sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"acronym":"SAC'10","name":"SAC'10: The 2010 ACM Symposium on Applied Computing","location":"Sierre Switzerland"},"container-title":["Proceedings of the 2010 ACM Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1774088.1774309","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1774088.1774309","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:23:36Z","timestamp":1750249416000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1774088.1774309"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,22]]},"references-count":16,"alternative-id":["10.1145\/1774088.1774309","10.1145\/1774088"],"URL":"https:\/\/doi.org\/10.1145\/1774088.1774309","relation":{},"subject":[],"published":{"date-parts":[[2010,3,22]]},"assertion":[{"value":"2010-03-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}