{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T04:26:23Z","timestamp":1762316783403,"version":"build-2065373602"},"reference-count":14,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2008,5,1]],"date-time":"2008-05-01T00:00:00Z","timestamp":1209600000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2008,5,1]],"date-time":"2008-05-01T00:00:00Z","timestamp":1209600000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100003711","name":"Ministry of Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003711","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004084","name":"Korea Science and Engineering Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004084","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003052","name":"Ministry of Trade, Industry and Energy","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003052","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013391","name":"Ministry of Education and Human Resources Development","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100013391","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information and Software Technology"],"published-print":{"date-parts":[[2008,5]]},"DOI":"10.1016\/j.infsof.2007.06.005","type":"journal-article","created":{"date-parts":[[2007,7,12]],"date-time":"2007-07-12T09:28:11Z","timestamp":1184232491000},"page":"569-578","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"title":["On-line generation association rules over data streams"],"prefix":"10.1016","volume":"50","author":[{"given":"Se Jung","family":"Shin","sequence":"first","affiliation":[]},{"given":"Won Suk","family":"Lee","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.infsof.2007.06.005_bib1","doi-asserted-by":"crossref","unstructured":"R. Agrawal, T. Imielinski, A. Swami, Mining association rules between sets of items in very large databases, in: Proceeding of ACM SIGMOD Conference Management of Data, May 1993, pp. 207\u2013216.","DOI":"10.1145\/170035.170072"},{"key":"10.1016\/j.infsof.2007.06.005_bib2","unstructured":"R. Agrawal, R. Srikant, Fast algorithms for mining association rules, in: Proceeding of the 20th International Conference on Very Large Databases (VLDB 1994), Santiago, Chile, 1994, pp. 487\u2013499."},{"key":"10.1016\/j.infsof.2007.06.005_bib3","doi-asserted-by":"crossref","unstructured":"M. Garofalakis, J. Gehrke, R. Rastogi, Querying and mining data streams: you only get one look, in: Tutorial notes of the 28th Int\u2019l Conference on Very Large Databases (VLDB 2002), Hong Kong, China, 2002.","DOI":"10.1145\/564793.564794"},{"key":"10.1016\/j.infsof.2007.06.005_bib4","doi-asserted-by":"crossref","unstructured":"J.H. Chang, W.S. Lee, Finding recent frequent itemsets adaptively over online data streams, in: Proceeding of the 9th ACM SIGKDD, 2003, pp. 487\u2013492.","DOI":"10.1145\/956750.956807"},{"key":"10.1016\/j.infsof.2007.06.005_bib5","unstructured":"D.S. Lee, W.S. Lee, Finding maximal frequent itemsets over online data streams adaptively, in: Proceeding of the Fifth IEEE International Conference on Data Mining ICDM \u201905, 2005."},{"key":"10.1016\/j.infsof.2007.06.005_bib6","doi-asserted-by":"crossref","unstructured":"G.S. Manku, R. Motwani, Approximate frequency counts over data streams, in: Proceeding of the 28th International Conference on Very Large Databases (VLDB 2002), Hong Kong, China, 2002, pp. 346\u2013357.","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"issue":"4","key":"10.1016\/j.infsof.2007.06.005_bib7","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1109\/69.940730","article-title":"A new approach to online generation of association rules","volume":"13","author":"Aggarwal","year":"2001","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.infsof.2007.06.005_bib8","unstructured":"Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi, Using association rules for fraud detection in web advertising network, in: Proceeding of the 31st international conference on Very large data bases, August 2005."},{"key":"10.1016\/j.infsof.2007.06.005_bib9","doi-asserted-by":"crossref","unstructured":"S. Brin, R. Motwani, J.D. Ullman, S. Tsur, Dynamic itemset counting and implication rules for market basket data, in: Proceeding of the ACM SIGMOD International Conference on Management of Data (SIGMOD 1997), Tucson, AZ, 1997, pp. 255\u2013264.","DOI":"10.1145\/253260.253325"},{"key":"10.1016\/j.infsof.2007.06.005_bib10","unstructured":"A. Savasers, E. Omiecinski, S. Navathe, An efficient algorithm for mining association rules in large databases, in: Proceedings of the 21st International Conference on Very Large Data Bases, 1995, pp. 432\u2013444."},{"issue":"1","key":"10.1016\/j.infsof.2007.06.005_bib11","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1023\/A:1026482903537","article-title":"Borders: an efficient algorithm for association generation in dynamic databases","volume":"12","author":"Aumann","year":"1999","journal-title":"Journal of Intelligent Information System"},{"key":"10.1016\/j.infsof.2007.06.005_bib12","doi-asserted-by":"crossref","unstructured":"V. Ganti, J. Gehrke, R. Ramakrishnan, DEMON: mining and monitoring evolving data, in: Proc. of the 16th Int\u2019l Conference on Data Engineering, San Diego, California, February 2000, pp. 439\u2013448.","DOI":"10.1109\/ICDE.2000.839443"},{"key":"10.1016\/j.infsof.2007.06.005_bib13","doi-asserted-by":"crossref","unstructured":"Yun Chi, Haixun Wang, Philip S. Yu, Richard R. Muntz, Moment: maintaining closed frequent itemsets over a stream sliding window, in: Proceedings of the 4th IEEE International Conference on Data Mining, 2004, pp. 59\u201366.","DOI":"10.1109\/ICDM.2004.10084"},{"key":"10.1016\/j.infsof.2007.06.005_bib14","unstructured":"Wei-Guang Teng, Ming-Syan Chen, Philip S. Yu, A regression-based temporal pattern mining scheme for data streams, in: Proceeding of the 29th International Conference on Very Large Database (VLDB 2003), Berlin, Germany, 2003."}],"container-title":["Information and Software Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950584907000651?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950584907000651?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T04:21:32Z","timestamp":1762316492000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0950584907000651"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5]]},"references-count":14,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2008,5]]}},"alternative-id":["S0950584907000651"],"URL":"https:\/\/doi.org\/10.1016\/j.infsof.2007.06.005","relation":{},"ISSN":["0950-5849"],"issn-type":[{"type":"print","value":"0950-5849"}],"subject":[],"published":{"date-parts":[[2008,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On-line generation association rules over data streams","name":"articletitle","label":"Article Title"},{"value":"Information and Software Technology","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.infsof.2007.06.005","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2007 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}