{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T06:02:40Z","timestamp":1760853760088,"version":"3.40.4"},"reference-count":33,"publisher":"Elsevier BV","content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1016\/j.ins.2014.03.074","type":"journal-article","created":{"date-parts":[[2014,3,24]],"date-time":"2014-03-24T14:53:56Z","timestamp":1395672836000},"page":"559-576","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":25,"special_numbering":"C","title":["CP-tree: An adaptive synopsis structure for compressing frequent itemsets over online data streams"],"prefix":"10.1016","volume":"278","author":[{"given":"Se Jung","family":"Shin","sequence":"first","affiliation":[]},{"given":"Dae Su","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Won Suk","family":"Lee","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ins.2014.03.074_b0005","doi-asserted-by":"crossref","unstructured":"R.C. Agarwal, C.C. Aggarwal, V.V.V. Prasad, Depth first generation of long patterns, in: Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2000, pp. 108\u2013118.","DOI":"10.1145\/347090.347114"},{"key":"10.1016\/j.ins.2014.03.074_b0010","unstructured":"R. Agrawal, R. Srikant, Fast algorithms for mining association rules, in: Proceedings of the 20th International Conference on Very Large Data, Bases, 1994, pp. 487\u2013499."},{"key":"10.1016\/j.ins.2014.03.074_b0015","doi-asserted-by":"crossref","unstructured":"R.J. Bayardo, Efficiently mining long patterns from databases, in: Proceedings of ACM Special Interest Group on Management of Data, 1998, pp. 85\u201393.","DOI":"10.1145\/276305.276313"},{"key":"10.1016\/j.ins.2014.03.074_b0020","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: Proceedings of the ACM SIGMOD International Conference on Management of Data, 1997, pp. 255\u2013264.","DOI":"10.1145\/253262.253325"},{"key":"10.1016\/j.ins.2014.03.074_b0025","doi-asserted-by":"crossref","unstructured":"D. Burdick, M. Calimlim, J. Gehrke, MAFIA: a maximal frequent itemset algorithm for transactional databases, in: Proceedings of the 17th International Conference on Data, Engineering, 2001, pp. 443\u2013452.","DOI":"10.1109\/ICDE.2001.914857"},{"key":"10.1016\/j.ins.2014.03.074_b0030","doi-asserted-by":"crossref","unstructured":"J.H. Chang, W.S. Lee, Finding recent frequent itemsets adaptively over online data streams, in: Proceedings of the 9th ACM SIGKDD International conference on Knowledge Discovery and Data Mining, 2003, pp. 487\u2013492.","DOI":"10.1145\/956804.956807"},{"key":"10.1016\/j.ins.2014.03.074_b0035","doi-asserted-by":"crossref","unstructured":"M. Charikar, K. Chen, M. Farach-Colton, Finding frequent items in data streams, in: Proceedings of the 29th International Colloquium on Automata, Language and Programming, 2002, pp. 693\u2013703.","DOI":"10.1007\/3-540-45465-9_59"},{"key":"10.1016\/j.ins.2014.03.074_b0040","doi-asserted-by":"crossref","unstructured":"Y. Chi, H. Wang, P. Yu, 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.ins.2014.03.074_b0045","doi-asserted-by":"crossref","unstructured":"Z. Chong, J.X. Yu, H. Lu, Z. Zhang, A. Zhou, False-negative frequent items mining from data streams with bursting, in: Proceedings of the 10th International Conference on Database Systems for Advanced Applications, 2005, pp. 422\u2013434.","DOI":"10.1007\/11408079_38"},{"key":"10.1016\/j.ins.2014.03.074_b0050","unstructured":"M. Datar, A. Gionis, P. Indyk, R. Motwani, Maintaining stream statistics over sliding windows, in: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 2002, pp. 635\u2013644."},{"key":"10.1016\/j.ins.2014.03.074_b0055","doi-asserted-by":"crossref","unstructured":"E.D. Demaine, A. Lopez-Ortiz, J.I. Munro, Frequency estimation of internet packet streams with limited space, in: Proc. 10th Annual European Symposium on Algorithms, 2002.","DOI":"10.1007\/3-540-45749-6_33"},{"key":"10.1016\/j.ins.2014.03.074_b0060","unstructured":"G. Dong, J. Han, L.V.S. Lakshmanan, J. Pei, H. Wang, P.S. Yu, Online mining of changes from data streams: research problems and preliminary results, in: Proceedings of the Workshop on Management and Processing of Data Streams, 2003."},{"key":"10.1016\/j.ins.2014.03.074_b0065","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 International Conference on Very Large Data, Bases, 2002.","DOI":"10.1145\/564793.564794"},{"key":"10.1016\/j.ins.2014.03.074_b0070","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10618-005-0002-x","article-title":"GenMax: an efficient algorithm for mining maximal frequent itemsets","volume":"11","author":"Gouda","year":"2005","journal-title":"Data Min. Knowl. Disc."},{"key":"10.1016\/j.ins.2014.03.074_b0075","doi-asserted-by":"crossref","unstructured":"S. Guha, N. Koudas, Approximating a data stream for querying and estimation: algorithms and performance evaluation, in: Proceedings of the 18th International Conference on Data, Engineering, 2002, pp. 567\u2013576.","DOI":"10.1109\/ICDE.2002.994775"},{"key":"10.1016\/j.ins.2014.03.074_b0080","doi-asserted-by":"crossref","unstructured":"J. Han, J. Pei, Y. Yin, Mining frequent patterns without candidate generation, in: Proceedings of the ACM SIGMOD International Conference on Management of Data, 2000, pp. 1\u201312.","DOI":"10.1145\/335191.335372"},{"key":"10.1016\/j.ins.2014.03.074_b0085","doi-asserted-by":"crossref","unstructured":"C. Hidber, Online association rule mining, in: Proceedings of the ACM SIGMOD International Conference on Management of Data, 1999, pp. 145\u2013156.","DOI":"10.1145\/304181.304195"},{"key":"10.1016\/j.ins.2014.03.074_b0090","unstructured":"H. Javitz, A. Valdes, The NIDES Statistical Component Description and Justification, Annual Report, SRI International, 1994."},{"key":"10.1016\/j.ins.2014.03.074_b0095","doi-asserted-by":"crossref","unstructured":"N. Jiang, L. Gruenwald, CFI-stream: mining closed frequent itemsets in data streams, in: Proceedings of 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2006.","DOI":"10.1145\/1150402.1150473"},{"key":"10.1016\/j.ins.2014.03.074_b0100","article-title":"Pincer-search: an efficient algorithm for discovering the maximum frequent set","author":"Lin","year":"2002","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.ins.2014.03.074_b0105","doi-asserted-by":"crossref","unstructured":"G.S. Manku, R. Motwani, Approximate frequency counts over data streams, in: Proceedings of the 28th International Conference on Very Large Data, Bases, 2002, pp. 346\u2013357.","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"10.1016\/j.ins.2014.03.074_b0110","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."},{"key":"10.1016\/j.ins.2014.03.074_b0115","doi-asserted-by":"crossref","unstructured":"W-G. Teng, M-S. Chen, P.S. Yu, A regression-based temporal pattern mining scheme for data streams, in: Proceeding of the 29th International Conference on Very Large Database, Berlin, Germany, 2003.","DOI":"10.1016\/B978-012722442-8\/50017-3"},{"key":"10.1016\/j.ins.2014.03.074_b0120","doi-asserted-by":"crossref","unstructured":"J. Wang, J. Han, J. Pei, Closet+: searching for the best strategies for mining frequent closed itemsets, in: Proceedings of 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2003.","DOI":"10.1145\/956750.956779"},{"key":"10.1016\/j.ins.2014.03.074_b0125","unstructured":"D. Xin, J. Han, X. Yan, H. Cheng, Mining compressed frequent-pattern sets, in: Proceedings of the 31st International Conference on Very Large Data, Bases, 2005."},{"key":"10.1016\/j.ins.2014.03.074_b0130","doi-asserted-by":"crossref","unstructured":"M. Zaki, C. Hsiao, Charm: an efficient algorithm for closed itemset mining, in: Proceedings of SIAM Conference on Data Mining, 2002.","DOI":"10.1137\/1.9781611972726.27"},{"issue":"1","key":"10.1016\/j.ins.2014.03.074_b0135","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10115-007-0092-4","article-title":"A survey on algorithms for mining frequent itemsets over data streams","volume":"16","author":"Cheng","year":"2008","journal-title":"Appeared Knowledge Inf. Syst."},{"key":"10.1016\/j.ins.2014.03.074_b0140","doi-asserted-by":"crossref","unstructured":"Hua-Fu Li, Suh-Yin Lee, Man-Kwan Shan, Online mining (recently) maximal frequent itemsets over data streams, in: Research Issues in Data Engineering: Stream Data Mining and Applications, RIDE-SDMA 2005, 2005, pp. 11\u201318.","DOI":"10.1109\/RIDE.2005.13"},{"key":"10.1016\/j.ins.2014.03.074_b0145","doi-asserted-by":"crossref","unstructured":"K. Li, Y. Yan Wang, M. Ellahi, H. An Wang, Mining recent frequent itemsets in data streams, in: The 5th International Conference on Fuzzy Systems and Knowledge, Discovery, 2008.","DOI":"10.1109\/FSKD.2008.255"},{"issue":"6","key":"10.1016\/j.ins.2014.03.074_b0150","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1016\/j.camwa.2008.10.060","article-title":"Mining frequent closed itemsets from a landmark window over online data streams","volume":"57","author":"Liu","year":"2009","journal-title":"Comput. Math. Appl."},{"year":"2010","series-title":"Knowledge Discovery from Data Streams","author":"Gama","key":"10.1016\/j.ins.2014.03.074_b0155"},{"year":"2012","series-title":"Learning in Non-Stationary Environments: Methods and Applications","author":"Sayed-Mouchaweh","key":"10.1016\/j.ins.2014.03.074_b0160"},{"year":"2011","series-title":"Evolving Fuzzy Systems: Methodologies, Advanced Concepts and Applications","author":"Lughofer","key":"10.1016\/j.ins.2014.03.074_b0165"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002002551400365X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002002551400365X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T04:18:37Z","timestamp":1746159517000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002002551400365X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9]]},"references-count":33,"alternative-id":["S002002551400365X"],"URL":"https:\/\/doi.org\/10.1016\/j.ins.2014.03.074","relation":{},"ISSN":["0020-0255"],"issn-type":[{"type":"print","value":"0020-0255"}],"subject":[],"published":{"date-parts":[[2014,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"CP-tree: An adaptive synopsis structure for compressing frequent itemsets over online data streams","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ins.2014.03.074","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2014 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}