{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T13:26:27Z","timestamp":1772112387630,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,3,11]],"date-time":"2007-03-11T00:00:00Z","timestamp":1173571200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,3,11]]},"DOI":"10.1145\/1244002.1244094","type":"proceedings-article","created":{"date-parts":[[2007,6,6]],"date-time":"2007-06-06T14:37:31Z","timestamp":1181140651000},"page":"388-392","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Maintenance of maximal frequent itemsets in large databases"],"prefix":"10.1145","author":[{"given":"Wang","family":"Lian","sequence":"first","affiliation":[{"name":"Macao University of Science and Technology, Avenida Wai Long, Macao"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David W.","family":"Cheung","sequence":"additional","affiliation":[{"name":"University of Hong Kong, Pokfulam Road, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. M.","family":"Yiu","sequence":"additional","affiliation":[{"name":"University of Hong Kong, Pokfulam Road, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,3,11]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"VLDB","author":"Agrawal R.","year":"1994","unstructured":"R. Agrawal and R. Srikant . Fast algorithms for mining association rules . VLDB , 1994 . R. Agrawal and R. Srikant. Fast algorithms for mining association rules. VLDB, 1994."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/312129.312252"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276313"},{"key":"e_1_3_2_1_4_1","volume-title":"UCI Repository of Machine Learning Databases","author":"Blake C.","year":"1998","unstructured":"C. Blake and C. Merz . UCI Repository of Machine Learning Databases , 1998 . http:\/\/www.ics.uci.edu\/mlearn\/MLRepository.html. C. Blake and C. Merz. UCI Repository of Machine Learning Databases, 1998. http:\/\/www.ics.uci.edu\/mlearn\/MLRepository.html."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253325"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.183"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/645481.655582"},{"key":"e_1_3_2_1_8_1","volume-title":"Proc. of SIGMOD Work-Shop on Research Issues in Data Mining and Knowlwdge Discovery","author":"Feldman R.","year":"1997","unstructured":"R. Feldman , Y. Aumann , A. Amir and H. Mannila . Efficient Algorithms for Discovering Frequent Sets in Incremental Databases . In Proc. of SIGMOD Work-Shop on Research Issues in Data Mining and Knowlwdge Discovery , 1997 . R. Feldman, Y. Aumann, A. Amir and H. Mannila. Efficient Algorithms for Discovering Frequent Sets in Incremental Databases. In Proc. of SIGMOD Work-Shop on Research Issues in Data Mining and Knowlwdge Discovery, 1997."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-005-0002-x"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/380995.381033"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.110"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/223784.223813"},{"key":"e_1_3_2_1_13_1","volume-title":"Proc. of the 3rd International conference on Knowledge Discovery and Data Mining","author":"Thomas S.","year":"1997","unstructured":"S. Thomas , S. Bodagala , K. Alsabti and S. Ranka . An Efficient Algorithm for the Incremental Updation of Association Rules in Large Databases . In Proc. of the 3rd International conference on Knowledge Discovery and Data Mining , 1997 . S. Thomas, S. Bodagala, K. Alsabti and S. Ranka. An Efficient Algorithm for the Incremental Updation of Association Rules in Large Databases. In Proc. of the 3rd International conference on Knowledge Discovery and Data Mining, 1997."},{"key":"e_1_3_2_1_14_1","volume-title":"Mining Frequent Itemsets in Evolving Databases. SIAM International Conference on Data Mining","author":"Veloso A.","year":"2002","unstructured":"A. Veloso , W. M. Jr., M. Carvalho , B. Possas , S. Parthasarathy and M. J. Zaki . Mining Frequent Itemsets in Evolving Databases. SIAM International Conference on Data Mining , 2002 . A. Veloso, W. M. Jr., M. Carvalho, B. Possas, S. Parthasarathy and M. J. Zaki. Mining Frequent Itemsets in Evolving Databases. SIAM International Conference on Data Mining, 2002."}],"event":{"name":"SAC07: The 2007 ACM Symposium on Applied Computing","location":"Seoul Korea","acronym":"SAC07","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"]},"container-title":["Proceedings of the 2007 ACM symposium on Applied computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1244002.1244094","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1244002.1244094","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:47:50Z","timestamp":1750258070000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1244002.1244094"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3,11]]},"references-count":14,"alternative-id":["10.1145\/1244002.1244094","10.1145\/1244002"],"URL":"https:\/\/doi.org\/10.1145\/1244002.1244094","relation":{},"subject":[],"published":{"date-parts":[[2007,3,11]]},"assertion":[{"value":"2007-03-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}