{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:28:24Z","timestamp":1760707704799},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540370253"},{"type":"electronic","value":"9783540370260"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11811305_5","type":"book-chapter","created":{"date-parts":[[2006,7,26]],"date-time":"2006-07-26T09:30:33Z","timestamp":1153906233000},"page":"56-63","source":"Crossref","is-referenced-by-count":23,"title":["A Fast Algorithm for Maintenance of Association Rules in Incremental Databases"],"prefix":"10.1007","author":[{"given":"Xin","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhi-Hong","family":"Deng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shiwei","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules between Sets of Items in Large Databases. In: Proceedings of ACM SIGMOD, May 1993, pp. 207\u2013216 (1993)","DOI":"10.1145\/170035.170072"},{"key":"5_CR2","unstructured":"Agrawal, R., Srikant, R.: Fast algorithm for mining Association rules. In: VLDB 1994, pp. 487\u2013499 (1994)"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Park, J.S., et al.: An effective hash based algorithm for mining of association rules. In: Proceedings of ACM SIGMOD Conference on Management of Data, May 1995, pp. 175\u2013186 (1995)","DOI":"10.1145\/223784.223813"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: Proceedings of the ACM SIGMOD Int. Conf. on Management of Data, pp. 1\u201312 (2000)","DOI":"10.1145\/342009.335372"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J.: Mining frequent patterns by pattern-growth: methodology and implications. In: SIGKDD 2000, pp. 14\u201320 (2000)","DOI":"10.1145\/380995.381002"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Zaki, Gouda, K.: Fast vertical mining using diffsets. In: SIGKDD 2003, pp. 326\u2013335 (2003)","DOI":"10.1145\/956755.956788"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Cheung, D.W., Han, J., Ng, V.T., Wong, C.Y.: Maintenance of Discovered Association Rules in Large Databases: An Incremental Update Technique. In: Proceedings of International Conference on Data Engineering, pp. 106\u2013114 (1996)","DOI":"10.1109\/ICDE.1996.492094"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Cheung, D.W., Lee, S.D., Kao, B.: A General Incremental Technique for Maintaining Discovered Association Rules. In: Proc. of the 5th International Conference on Database Systems for Advanced Applications, pp. 185\u2013194 (1997)","DOI":"10.1142\/9789812819536_0020"},{"key":"5_CR9","unstructured":"Thomas, S., Bodagala, S., Alsabti, K., Ranka, S.: An Efficient Algorithm for the Incremental Updation of Association Rules in Large Databases. In: Proc. of 3rd International conference on Knowledge Discovery and Data Mining, pp. 263\u2013266 (1997)"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-540-24571-1_38","volume-title":"Database Systems for Advanced Applications","author":"J.-L. Koh","year":"2004","unstructured":"Koh, J.-L., Shieh, S.-F.: An Efficient Approach for Maintaining Association Rules Based on Adjusting FP-Tree Structures. In: Lee, Y., Li, J., Whang, K.-Y., Lee, D. (eds.) DASFAA 2004. LNCS, vol.\u00a02973, pp. 417\u2013424. Springer, Heidelberg (2004)"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Burdick, D., Calimlim, M., Gehrke, J.: MAFIA: A maximal frequent itemset algorithm for transactional databases. In: ICDE 2001, pp. 443\u2013452 (2001)","DOI":"10.1109\/ICDE.2001.914857"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Zaki, M., Hsiao, C.: CHARM: An efficient algorithm for closed itemset mining. In: SDM 2002, pp. 12\u201328 (2002)","DOI":"10.1137\/1.9781611972726.27"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Wang, J.Y., Han, J., Pei, J.: CLOSET+: Searching for the Best Strategies for Mining Frequent Closed Itemsets. In: SIGKDD 2003, pp. 236\u2013245 (2003)","DOI":"10.1145\/956755.956779"}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11811305_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T04:11:15Z","timestamp":1555733475000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11811305_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540370253","9783540370260"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11811305_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}