{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:12:00Z","timestamp":1774415520176,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540425342","type":"print"},{"value":"9783540447948","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44794-6_5","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:37:34Z","timestamp":1184603854000},"page":"54-66","source":"Crossref","is-referenced-by-count":31,"title":["Computing Association Rules Using Partial Totals"],"prefix":"10.1007","author":[{"given":"Frans","family":"Coenen","sequence":"first","affiliation":[]},{"given":"Graham","family":"Goulbourne","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Leng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,28]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, R., Aggarwal, C. and Prasad, V. Depth First Generation of Long Patterns. Proc ACM KDD 2000 Conference, Boston, 108\u2013118, 2000.","DOI":"10.1145\/347090.347114"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R. Imielinski, T. Swami, A. Mining Association Rules Between Sets of Items in Large Databases. SIGMOD-93, 207\u2013216. May 1993.","DOI":"10.1145\/170036.170072"},{"key":"5_CR3","unstructured":"Agrawal, R. and Srikant, R. Fast Algorithms for Mining Association Rules. Proc 20th VLDB Conference, Santiago, 487\u2013499. 1994"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Bayardo, R.J. Efficiently Mining Long Patterns from Databases. Proc ACM-SIGMOD Int Conf on Management of Data, 85\u201393, 1998","DOI":"10.1145\/276304.276313"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Bayardo, R.J., Agrawal, R. and Gunopolos, D. Constraint-based rule mining in large, dense databases. Proc 15th Int Conf on Data Engineering, 1999","DOI":"10.1109\/ICDE.1999.754924"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Brin, S., Motwani. R., Ullman, J.D. and Tsur, S. Dynamic itemset counting and implication rules for market basket data. Proc ACM SIGMOD Conference, 255\u2013256, 1997","DOI":"10.1145\/253260.253325"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0950-7051(00)00055-1","volume":"13","author":"G. Goulbourne","year":"2000","unstructured":"Goulbourne, G., Coenen, F. and Leng, P. Algorithms for Computing Association Rules using a Partial-Support Tree. J. Knowledge-Based Systems 13 (2000), 141\u2013149. (also Proc ES\u201999.)","journal-title":"J. Knowledge-Based Systems"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J. and Yin, Y. Mining Frequent Patterns without Candidate Generation. Proc ACM SIGMOD 2000 Conference, 1\u201312, 2000.","DOI":"10.1145\/342009.335372"},{"key":"5_CR9","series-title":"Research Report","volume-title":"Set-oriented mining of association rules","author":"M. Houtsma","year":"1993","unstructured":"Houtsma, M. and Swami, A. Set-oriented mining of association rules. Research Report RJ 9567, IBM Almaden Research Centre, San Jose, October 1993."},{"key":"5_CR10","unstructured":"Rymon, R. Search Through Systematic Set Enumeration. Proc. 3rd Int\u2019l Conf. on Principles of Knowledge Representation and Reasoning, 1992, 539\u2013550."},{"key":"5_CR11","unstructured":"Savasere, A., Omiecinski, E. and Navathe, S. An efficient algorithm for mining association rules in large databases. Proc 21st VLDB Conference, Zurich, 432\u2013444. 1995."},{"key":"5_CR12","unstructured":"Toivonen, H. Sampling large databases for association rules. Proc 22nd VLDB Conference, 134\u2013145. Bombay, 1996."},{"key":"5_CR13","series-title":"Technical report","volume-title":"New Algorithms for fast discovery of association rules","author":"M.J. Zaki","year":"1997","unstructured":"Zaki, M.J., Parthasarathy, S. Ogihara, M. and Li, W. New Algorithms for fast discovery of association rules. Technical report 651, University of Rochester, Computer Science Department, New York. July 1997."}],"container-title":["Lecture Notes in Computer Science","Principles of Data Mining and Knowledge Discovery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44794-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T03:40:30Z","timestamp":1556682030000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44794-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425342","9783540447948"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-44794-6_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}