{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:52:27Z","timestamp":1773481947542,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540413523","type":"print"},{"value":"9783540444183","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44418-1_1","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T01:00:14Z","timestamp":1186880414000},"page":"1-14","source":"Crossref","is-referenced-by-count":10,"title":["A Survey of Association-Rule Mining"],"prefix":"10.1007","author":[{"given":"Jeffrey D.","family":"Ullman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,10,19]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"R. Agrawal, T. Imielinski, and A. Swami, \u201cMining Associations between Sets of Items in Massive Databases,\u201d Proc. of the ACM SIGMOD Int\u2019l. Conference on Management of Data, May 1993, pp. 207\u2013216.","DOI":"10.1145\/170036.170072"},{"key":"1_CR2","unstructured":"R. Agrawal and R. Srikant, \u201cFast Algorithms for Mining Association Rules,\u201d Proc. 20th Int\u2019l. Conference on Very Large Databases, Sept. 1994."},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"E. Cohen et al., \u201cFinding Interesting Associations without Support Pruning,\u201d Proc. Int\u2019l. Conference on Data Engineering, 2000.","DOI":"10.1109\/ICDE.2000.839448"},{"key":"1_CR4","unstructured":"M. Fang, N. Shivakumar, H. Garcia-Molina, R. Motwani, and J. Ullman, \u201cComputing Iceberg Queries Efficiently,\u201d Proc. 20th Int\u2019l. Conference on Very Large Databases, 1998."},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"J. S. Park, M.-S. Chen, and P. S. Yu, \u201cAn Effective Hash-Based Algorithm for Mining Association Rules,\u201d Proc. of the ACM SIGMOD Int\u2019l. Conference on Management of Data, 1995, pp. 175\u2013186.","DOI":"10.1145\/223784.223813"},{"key":"1_CR6","unstructured":"A. Savesere, E. Omiecinski, and S. Navathe, \u201cAn efficient algorithm for mining association rules in large databases,\u201d Proc. 20th Int\u2019l. Conference on Very Large Databases, 1995, pp. 432\u2013444."},{"key":"1_CR7","unstructured":"H. Toivonen, \u201cSampling Large Databases for Association Rules,\u201d Proc. 20th Int\u2019l. Conference on Very Large Databases, 1996, pp. 134\u2013145."}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44418-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T19:41:36Z","timestamp":1556739696000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44418-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540413523","9783540444183"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-44418-1_1","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}