{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T04:11:23Z","timestamp":1749615083322,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440376"},{"type":"electronic","value":"9783540456810"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45681-3_9","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T11:03:25Z","timestamp":1192791805000},"page":"99-111","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Finding Association Rules with Some Very Frequent Attributes"],"prefix":"10.1007","author":[{"given":"Frans","family":"Coenen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Leng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,18]]},"reference":[{"key":"9_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":"9_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":"9_CR3","unstructured":"Agrawal, R. and Srikant, R. Fast Algorithms for Mining Association Rules. Proc 20th VLDB Conference, Santiago, 487\u2013499. 1994"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Bayardo, R. J. Efficiently Mining Long Patterns from Databases. Proc ACMSIGMOD Int Conf on Management of Data, 85\u201393, 1998","DOI":"10.1145\/276304.276313"},{"key":"9_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":"9_CR6","unstructured":"Berry, M. J. and Lino., G. S. Data Mining Techniques for Marketing, Sales and Customer Support. John Wiley and sons, 1997"},{"key":"9_CR7","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\/253262.253325"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Coenen, F. and Leng, P. Optimising Association Rule Algorithms Using Itemset Ordering. In Research and Development in Intelligent Systems XVIII, (Proc ES2001), eds M. Bramer, F Coenen and A Preece, Springer, Dec 2001, 53\u201366","DOI":"10.1007\/978-1-4471-0119-2_5"},{"key":"9_CR9","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.) 101","journal-title":"J. Knowledge-Based Systems"},{"key":"9_CR10","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":"9_CR11","doi-asserted-by":"crossref","unstructured":"Liu, B., Hsu, W. and Ma, Y. Mining association rules with multiple minimum supports. Proc. KDD-99, ACM, 1999, 337\u2013341","DOI":"10.1145\/312129.312274"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Coenen, F., Goulbourne, G. and Leng, P. Computing Association Rules Using Partial Totals. Proc PKDD 2001, eds L. De Raedt and A Siebes, LNAI 2168, August 2001, 54\u201366","DOI":"10.1007\/3-540-44794-6_5"},{"key":"9_CR13","unstructured":"Rymon, R. Search Through Systematic Set Enumeration. Proc. 3rd Int\u2019l Conf. on Principles of Knowledge Representation and Reasoning, 1992, 539\u2013550"},{"key":"9_CR14","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":"9_CR15","unstructured":"Toivonen, H. Sampling large databases for association rules. Proc 22nd VLDB Conference, 134\u2013145. Bombay, 1996"}],"container-title":["Lecture Notes in Computer Science","Principles of Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45681-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T16:35:50Z","timestamp":1749573350000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-45681-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440376","9783540456810"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45681-3_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"18 September 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}