{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T15:05:26Z","timestamp":1747580726093},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540646594"},{"type":"electronic","value":"9783540691129"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0053471","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T07:27:42Z","timestamp":1149665262000},"page":"49-63","source":"Crossref","is-referenced-by-count":13,"title":["Efficient mining of association rules in large dynamic databases"],"prefix":"10.1007","author":[{"given":"Edward","family":"Omiecinski","sequence":"first","affiliation":[]},{"given":"Ashok","family":"Savasere","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,23]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, pages 207\u2013216, Washington, DC, May 26\u201328 1993.","DOI":"10.1145\/170035.170072"},{"key":"4_CR2","unstructured":"R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In Proceedings of the 20th International Conference on Very Large Data Bases, Santiago, Chile, August 29\u2013September 1 1994."},{"key":"4_CR3","unstructured":"J. Han and Y. Fu. Discovery of multiple-level association rules from large databases. In Proceedings of the VLDB Conference, pages 420\u2013431, September 1995."},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"M. Houtsma and A. Swami. Set-oriented mining of association rules. In Proceedings of the International Conference on Data Engineering, Taipei, Taiwan, March 1995.","DOI":"10.1109\/ICDE.1995.380413"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"J. S. Park, M-S. Chen, and P. S. Yu. An effective hash based algorithm for mining association rules. In Proceedings of the ACM-SIGMOD Conference on Management of Data, pages 229\u2013248, San Jose, California, May 1995.","DOI":"10.1145\/223784.223813"},{"key":"4_CR6","unstructured":"A. Savasere, E. Omiecinski, and S. Navathe. An efficient algorithm for mining association rules in large databases. In Proceedings of the 21st International Conference on Very Large Data Bases, pages 688\u2013192, Zurich, Swizerland, August 1995."},{"key":"4_CR7","volume-title":"Technical Report GIT-CC-95-04","author":"A. Savasere","year":"1995","unstructured":"A. Savasere, E. Omiecinski, and S. Navathe. An efficient algorithm for mining association rules in large databases. Technical Report GIT-CC-95-04, Georgia Institute of Technology, Atlanta, GA 30332, January 1995."}],"container-title":["Lecture Notes in Computer Science","Advances in Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0053471","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,10]],"date-time":"2019-02-10T22:24:43Z","timestamp":1549837483000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0053471"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540646594","9783540691129"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/bfb0053471","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}