{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T12:10:06Z","timestamp":1737115806534,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540717003"},{"type":"electronic","value":"9783540717010"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71701-0_50","type":"book-chapter","created":{"date-parts":[[2007,6,20]],"date-time":"2007-06-20T15:31:38Z","timestamp":1182353498000},"page":"489-497","source":"Crossref","is-referenced-by-count":1,"title":["Evolution and Maintenance of Frequent Pattern Space When Transactions Are Removed"],"prefix":"10.1007","author":[{"given":"Mengling","family":"Feng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guozhu","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinyan","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yap-Peng","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Limsoon","family":"Wong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"50_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., et al.: Mining association rules between sets of items in large databases. In: SIGMOD, pp. 207\u2013216 (1993)","DOI":"10.1145\/170035.170072"},{"issue":"1","key":"50_CR2","first-page":"61","volume":"12","author":"Y. Aumann","year":"1999","unstructured":"Aumann, Y., et al.: Borders: An efficient algorithm for association generation in dynamic databases. JIIS\u00a012(1), 61\u201373 (1999)","journal-title":"JIIS"},{"key":"50_CR3","doi-asserted-by":"crossref","unstructured":"Bayardo, R.J.: Efficiently mining long patterns from databases. In: SIGMOD, pp. 85\u201393 (1998)","DOI":"10.1145\/276304.276313"},{"key":"50_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/3-540-36175-8_30","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"C. Chang","year":"2003","unstructured":"Chang, C., et al.: Enhancing SWF for incremental association mining by itemset maintenance. In: Whang, K.-Y., et al. (eds.) PAKDD 2003. LNCS (LNAI), vol.\u00a02637, pp. 301\u2013312. Springer, Heidelberg (2003)"},{"key":"50_CR5","doi-asserted-by":"crossref","unstructured":"Cheung, D., et al.: Maintenance of discovered association rules in large databases: An incremental update technique. In: ICDE, pp. 106\u2013114 (1996)","DOI":"10.1109\/ICDE.1996.492094"},{"key":"50_CR6","doi-asserted-by":"crossref","unstructured":"Cheung, D., et al.: A general incremental technique for maintaining discovered association rules. In: Proc. 1996 DASFAA, pp. 185\u2013194 (1997)","DOI":"10.1142\/9789812819536_0020"},{"key":"50_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10618-005-0002-x","volume":"11","author":"K. Gouda","year":"2005","unstructured":"Gouda, K., et al.: GenMax: An efficient algorithm for mining maximal frequent itemsets. Data Mining and Knowledge Discovery\u00a011, 1\u201320 (2005)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"50_CR8","doi-asserted-by":"crossref","unstructured":"Han, J., et al.: Mining frequent patterns without candidates generation. In: SIGMOD, pp. 1\u201312 (2000)","DOI":"10.1145\/342009.335372"},{"issue":"3","key":"50_CR9","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.is.2004.02.001","volume":"30","author":"C. Lee","year":"2005","unstructured":"Lee, C., et al.: Sliding window filtering: An efficient method for incremental mining on a time-variant database. Information Systems\u00a030(3), 227\u2013244 (2005)","journal-title":"Information Systems"},{"key":"50_CR10","doi-asserted-by":"crossref","unstructured":"Li, H., et al.: Relative risk and odds ratio: A data mining perspective. In: PODS, pp. 368\u2013377 (2005)","DOI":"10.1145\/1065167.1065215"},{"key":"50_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/3-540-49257-7_25","volume-title":"Database Theory - ICDT\u201999","author":"N. Pasquier","year":"1999","unstructured":"Pasquier, N., et al.: Discovering frequent closed itemsets for association rules. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, pp. 398\u2013416. Springer, Heidelberg (1999)"},{"key":"50_CR12","doi-asserted-by":"crossref","unstructured":"Veloso, A.A., et al.: Mining frequent itemsets in evolving databases. In: SIAM (2002)","DOI":"10.1137\/1.9781611972726.29"},{"key":"50_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/11546849_30","volume-title":"Data Warehousing and Knowledge Discovery","author":"S. Zhang","year":"2005","unstructured":"Zhang, S., et al.: A decremental algorithm for maintaining frequent itemsets in dynamic databases. In: Tjoa, A.M., Trujillo, J. (eds.) DaWaK 2005. LNCS, vol.\u00a03589, pp. 305\u2013314. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71701-0_50.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T11:00:51Z","timestamp":1737111651000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71701-0_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540717003","9783540717010"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71701-0_50","relation":{},"subject":[]}}