{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:22:21Z","timestamp":1742919741203,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540332923"},{"type":"electronic","value":"9783540332930"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11733492_3","type":"book-chapter","created":{"date-parts":[[2006,3,4]],"date-time":"2006-03-04T11:29:53Z","timestamp":1141471793000},"page":"38-54","source":"Crossref","is-referenced-by-count":0,"title":["Memory-Aware Frequent k-Itemset Mining"],"prefix":"10.1007","author":[{"given":"Maurizio","family":"Atzori","sequence":"first","affiliation":[]},{"given":"Paolo","family":"Mancarella","sequence":"additional","affiliation":[]},{"given":"Franco","family":"Turini","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/360402.360421","volume":"2","author":"J. Hipp","year":"2000","unstructured":"Hipp, J., G\u00fcntzer, U., Nakhaeizadeh, G.: Algorithms for association rule mining \u2013 a general survey and comparison. SIGKDD Explorations\u00a02, 58\u201364 (2000)","journal-title":"SIGKDD Explorations"},{"key":"3_CR2","unstructured":"Goethals, B.: Survey on frequent pattern mining (2003)"},{"key":"3_CR3","unstructured":"Li, W., Han, J., Pei, J.: CMAR: Accurate and efficient classification based on multiple class-association rules. In: International Conference on Data Mining, pp. 369\u2013376 (2001)"},{"key":"3_CR4","unstructured":"Han, E.H., Karypis, G., Kumar, V., Mobasher, B.: Clustering based on association rule hypergraphs. In: Research Issues on Data Mining and Knowledge Discovery (1997)"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/342009.335372","volume-title":"Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data","author":"J. Han","year":"2000","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Chen, W., Naughton, J.F., Bernstein, P.A. (eds.) Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, Dallas, Texas, USA, May 16-18, 2000, pp. 1\u201312. ACM, New York (2000)"},{"key":"3_CR6","first-page":"487","volume-title":"Proc. 20th Int. Conf. Very Large Data Bases, VLDB","author":"R. Agrawal","year":"1994","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Bocca, J.B., Jarke, M., Zaniolo, C. (eds.) Proc. 20th Int. Conf. Very Large Data Bases, VLDB, pp. 487\u2013499. Morgan Kaufmann, San Francisco (1994)"},{"key":"3_CR7","volume-title":"Proceedings of the ACM PODS 2003","author":"R.M. Karp","year":"2003","unstructured":"Karp, R.M., Shenker, S., Papadimitriou, C.H.: A simple algorithm for finding frequent elements in streams and bags. In: Proceedings of the ACM PODS 2003, vol.\u00a028, ACM Press, New York (2003)"},{"key":"3_CR8","unstructured":"Savasere, A., Omiecinski, E., Navathe, S.B.: An efficient algorithm for mining association rules in large databases. The VLDB Journal, 432\u2013444 (1995)"},{"key":"3_CR9","first-page":"134","volume-title":"Proc. 1996 Int. Conf. Very Large Data Bases","author":"H. Toivonen","year":"1996","unstructured":"Toivonen, H.: Sampling large databases for association rules. In: Vijayaraman, T.M., Buchmann, A.P., Mohan, C., Sarda, N.L. (eds.) Proc. 1996 Int. Conf. Very Large Data Bases, pp. 134\u2013145. Morgan Kaufmann, San Francisco (1996)"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1145\/775047.775114","volume-title":"Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining","author":"B. Chen","year":"2002","unstructured":"Chen, B., Haas, P., Scheuermann, P.: A new two-phase sampling based algorithm for discovering association rules. In: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 462\u2013468. ACM Press, New York (2002)"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Chen, B., Haas, P.J., Schauermann, P.: Fast: A new sampling-based algorithm for discovering association rules. In: 18th International Conference on Data Engineering (2002)","DOI":"10.1145\/775047.775114"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Goethals, B.: Memory issues in frequent itemset mining. In: Proceedings of the 2004 ACM Symposium on Applied Computing (SAC 2004), Nicosia, Cyprus, March 14 \u201317. ACM, New York (2004)","DOI":"10.1145\/967900.968012"},{"key":"3_CR13","first-page":"372","volume-title":"IEEE Transactions on Knowledge and Data Engineering","author":"M.J. Zaki","year":"2000","unstructured":"Zaki, M.J.: Scalable algorithms for association mining. In: IEEE Transactions on Knowledge and Data Engineering, pp. 372\u2013390. ACM Press, New York (2000)"},{"key":"3_CR14","unstructured":"Goethals, B., Zaki, M.J. (eds.): Proceedings of the ICDM 2003, Workshop on Frequent Itemset Mining Implementations, FIMI 2003, Melbourne, Florida, USA, December 19. CEUR Workshop Proceedings, vol.\u00a090. CEUR-WS.org (2003)"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Giannotti, F., Mazzanti, A., Pedreschi, D.: Examiner: Optimized levelwise frequent pattern mining with monotone constraint. In: International Conference on Data Mining 2003, Melbourne, Florida, USA, pp. 11\u201318 (2003)","DOI":"10.1109\/ICDM.2003.1250892"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Borgelt, C.: Keeping things simple: Finding frequent item sets by recursive elimination. In: Workshop Open Software for Data Mining, on Frequent Pattern Mining Implementations (OSDM 2005), Chicago, IL, USA (2005)","DOI":"10.1145\/1133905.1133914"}],"container-title":["Lecture Notes in Computer Science","Knowledge Discovery in Inductive Databases"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11733492_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T22:46:20Z","timestamp":1736289980000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11733492_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540332923","9783540332930"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11733492_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}