{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T04:11:23Z","timestamp":1749615083286,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440376"},{"type":"electronic","value":"9783540456810"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45681-3_36","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T11:03:25Z","timestamp":1192791805000},"page":"435-448","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Efficiently Mining Approximate Models of Associations in Evolving Databases"],"prefix":"10.1007","author":[{"given":"Adriano","family":"Veloso","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruno","family":"Gusm\u00e3o","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"Jr.","given":"Wagner","family":"Meira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcio","family":"Carvalho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srini","family":"Parthasarathy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammed","family":"Zaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,18]]},"reference":[{"key":"36_CR1","unstructured":"R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. of the 20\n                           th\n                           Int\u2019l Conf. on Very Large Databases, San Tiago, Chile, June 1994."},{"key":"36_CR2","unstructured":"D. Cheung, J. Han, V. Ng, and C. Y. Wong. Maintenance of discovered association rules in large databases: An incremental updating technique. In Proc. of the 12\n                           th\n                           Intl. Conf. on Data Engineering, February 1996."},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"D. Cheung, K. Hu, and S. Xia. Asynchronous parallel algorithm for mining association rules on a shared-memorym ultipprocessors. In ACM Symposium on Parallel Algorithms and Architectures, pages 279\u2013288, 1998.","DOI":"10.1145\/277651.277694"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"D. Cheung, S. Lee, and B. Kao. A general incremental technique for maintaining discovered association rules. In Proc. of the 5\n                           th\n                           Intl. Conf. on Database Systems for Advanced Applications, pages 1\u20134, April 1997.","DOI":"10.1142\/9789812819536_0020"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"V. Ganti, J. Gehrke, and R. Ramakrishnan. Demon: Mining and monitoring evolving data. In Proc. of the 16\n                           th\n                           Int\u2019l Conf. on Data Engineering, pages 439\u2013448, San Diego, USA, May 2000.","DOI":"10.1109\/ICDE.2000.839443"},{"key":"36_CR6","unstructured":"K. Gouda and M. Zaki. Efficientlymining maximal frequent itemsets. In Proc. of the 1\n                           st\n                           IEEE Int\u2019l Conference on Data Mining, San Jose, USA, November 2001."},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"J. Han, H. Jamil, Y. Lu, L. Chen, Y. Liao, and J. Pei. Dna-miner: A system prototype for mining dna sequences. In Proc. of the 2001 ACM-SIGMOD Int\u2019l. Conf. on Management of Data, Santa Barbara, CA, May 2001.","DOI":"10.1145\/375663.375786"},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proc. of the ACM SIGMOD Int\u2019l Conf. on Management of Data, May 2000.","DOI":"10.1145\/342009.335372"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"C. Kamath. On mining scientific datasets. In et al R. L. Grossman, editor, Data Mining for Scientific and Engineering Applications, pages 1\u201321. Kluwer Academic Publishers, 2001.","DOI":"10.1007\/978-1-4615-1733-7_1"},{"key":"36_CR10","unstructured":"S. Lee and D. Cheung. Maintenance of discovered association rules: When to update? In Research Issues on Data Mining and Knowledge Discovery, page March, 1997."},{"key":"36_CR11","unstructured":"H. Mannila and H. Toivonen. Levelwise search and borders of theories in knowledge discovery. In Technical Report TR C-1997-8, U. of Helsinki, January 1997."},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"S. Parthasarathy, M. Zaki, M. Ogihara, and S. Dwarkadas. Incremental and interactive sequence mining. ACM Confereince on Information and Knowledge Management (CIKM), Mar 1999.","DOI":"10.1145\/319950.320010"},{"key":"36_CR13","doi-asserted-by":"crossref","unstructured":"S. Parthasarathy, M. Zaki, M. Ogihara, and W. Li. Parallel data mining for association rules on shared-memorysy stems. In Knowledge and Information Systems, Santa Barbara, CA, February 2001.","DOI":"10.1007\/PL00011656"},{"key":"36_CR14","doi-asserted-by":"crossref","unstructured":"M. Rajman and R. Besan. Text mining-knowledge extraction from unstructured textual data. In Proc. of the 6\n                           th\n                           Int'l Conf. Federation of Classication Societies, pages 473\u2013480, Roma, Italy, 1998.","DOI":"10.1007\/978-3-642-72253-0_64"},{"key":"36_CR15","unstructured":"S. Thomas, S. Bodagala, K. Alsabti, and S. Ranka. An efficient algorithm for the incremental updation of association rules. In Proc. of the 3\n                           rd\n                           Int\u2019l Conf. on Knowledge Discovery and Data Mining, August 1997."},{"key":"36_CR16","doi-asserted-by":"crossref","unstructured":"A. Veloso, W. Meira Jr., M. B. de Carvalho, B. P\u00f4ssas, S. Parthasarathy, and M. Zaki. Mining frequent itemsets in evolving databases. In Proc. of the 2\n                           nd\n                           SIAM Int\u2019l Conf. on Data Mining, Arlington, USA, May 2002.","DOI":"10.1137\/1.9781611972726.29"},{"key":"36_CR17","doi-asserted-by":"crossref","unstructured":"A. Veloso, B. Rocha, W. Meira Jr., and M. de Carvalho. Real world association rule mining. In Proc. of the 19th British National Conf. on Databases (to appear), July 2002.","DOI":"10.1007\/3-540-45495-0_13"},{"key":"36_CR18","doi-asserted-by":"crossref","unstructured":"M. Zaki and C. Hsiao. Charm: An efficient algorithm for closed itemset mining. In Proc. of the 2nd SIAM Int'l Conf. on Data Mining, Arlington, USA, May 2002.","DOI":"10.1137\/1.9781611972726.27"},{"key":"36_CR19","doi-asserted-by":"crossref","unstructured":"M. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New algorithms for fast discovery of association rules. In Proc. of 3\n                           rd\n                           Int\u2019l Conf. Knowledge Discovery and Data Mining, August 1997.","DOI":"10.1007\/978-1-4615-5669-5_1"},{"issue":"1","key":"36_CR20","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1023\/A:1009773317876","volume":"4","author":"M. Zaki","year":"1997","unstructured":"M. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New parallel algorithms for fast discoveryof association rules. Data Mining and Knowledge Discovery: An International Journal, 4(1):343\u2013373, December 1997.","journal-title":"Data Mining and Knowledge Discovery: An International Journal"}],"container-title":["Lecture Notes in Computer Science","Principles of Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45681-3_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T16:35:25Z","timestamp":1749573325000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-45681-3_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440376","9783540456810"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-45681-3_36","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"18 September 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}