{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T12:10:06Z","timestamp":1746360606605,"version":"3.40.4"},"publisher-location":"Cham","reference-count":80,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319078205"},{"type":"electronic","value":"9783319078212"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07821-2_9","type":"book-chapter","created":{"date-parts":[[2014,8,29]],"date-time":"2014-08-29T06:36:06Z","timestamp":1409294166000},"page":"199-224","source":"Crossref","is-referenced-by-count":15,"title":["Frequent Pattern Mining in Data Streams"],"prefix":"10.1007","author":[{"given":"Victor E.","family":"Lee","sequence":"first","affiliation":[]},{"given":"Ruoming","family":"Jin","sequence":"additional","affiliation":[]},{"given":"Gagan","family":"Agrawal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,8,30]]},"reference":[{"key":"9_CR1","unstructured":"R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. of Int. conf. Very Large DataBases (VLDB'94), pages\u00a0487\u2013499, Santiago, Chile, September 1994."},{"key":"9_CR2","unstructured":"Rakesh Agrawal and Ramakrishnan Srikant. Fast algorithms for mining association rules in large databases. In Proceedings of the 20th International Conference on Very Large Data Bases, VLDB '94, pages\u00a0487\u2013499, San Francisco, CA, USA, 1994. Morgan Kaufmann Publishers Inc."},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Rakesh Agrawal and Ramakrishnan Srikant. Mining sequential patterns. In Data Engineering, 1995. Proceedings of the Eleventh International Conference on, pages\u00a03\u201314. IEEE, 1995.","DOI":"10.1109\/ICDE.1995.380415"},{"key":"9_CR4","unstructured":"R. Agrawal, H. Mannila, R. Srikant, H. Toivonent, and A. Inkeri Verkamo. Fast discovery of association rules. In U. Fayyad and et al, editors, Advances in Knowledge Discovery and Data Mining, pages\u00a0307\u2013328. AAAI Press, Menlo Park, CA, 1996."},{"issue":"1\u20132","key":"9_CR5","doi-asserted-by":"publisher","first-page":"975","DOI":"10.14778\/1920841.1920964","volume":"3","author":"Charu C. Aggarwal","year":"2010","unstructured":"Charu C. Aggarwal, Yao Li, Philip S. Yu, and Ruoming Jin. On dense pattern mining in graph streams. Proc. VLDB Endow., 3(1\u20132):975\u2013984, September 2010.","journal-title":"Proc. VLDB Endow"},{"key":"9_CR6","unstructured":"Tatsuya Asai, Hiroki Arimura, Kenji Abe, Shinji Kawasoe, and Setsuo Arikawa. Online algorithms for mining semi-structured data stream. In Data Mining, 2002. ICDM 2003. Proceedings. 2002 IEEE International Conference on, pages\u00a027\u201334. IEEE, 2002."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Tatsuya Asai, Kenji Abe, Shinji Kawasoe, Hiroki Arimura, and Setsuo Arikawa. Efficient algorithms for finding frequent substructures from semi-structured data streams. In New Frontiers in Artificial Intelligence, pages\u00a029\u201345. Springer, 2007.","DOI":"10.1007\/978-3-540-71009-7_3"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom. Models and Issues in Data Stream Systems. In Proceedings of the 2002 ACM Symposium on Principles of Database Systems (PODS 2002) (Invited Paper). ACM Press, June 2002.","DOI":"10.1145\/543614.543615"},{"key":"9_CR9","unstructured":"Albert Bifet. Adaptive stream mining: Pattern learning and mining from evolving data streams. In Proceedings of the 2010 conference on Adaptive Stream Mining: Pattern Learning and Mining from Evolving Data Streams, pages\u00a01\u2013212, Amsterdam, The Netherlands, The Netherlands, 2010. IOS Press."},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Albert Bifet and Ricard Gavald\u00e0. Mining adaptively frequent closed unlabeled rooted trees in data streams. In Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '08, pages\u00a034\u201342, New York, NY, USA, 2008. ACM.","DOI":"10.1145\/1401890.1401900"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Albert Bifet, Geoff Holmes, Bernhard Pfahringer, and Ricard Gavald\u00e0. Mining frequent closed graphs on evolving data streams. In Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '11, pages\u00a0591\u2013599, New York, NY, USA, 2011. ACM.","DOI":"10.1145\/2020408.2020501"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"\\refauHerv\u00e9 Br\u00f6nnimann, Bin Chen, Manoranjan Dash, Peter Haas, and Peter Scheuermann. Efficient data reduction with ease. In Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '03, pages\u00a059\u201368, New York, NY, USA, 2003. ACM.","DOI":"10.1145\/956755.956761"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Toon Calders, Nele Dexters, and Bart Goethals. Mining frequent itemsets in a stream. In Data Mining, 2007. ICDM 2007. Seventh IEEE International Conference on, pages\u00a083\u201392. IEEE, 2007.","DOI":"10.1109\/ICDM.2007.66"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Joong Hyuk Chang and Won Suk Lee. Finding recent frequent itemsets adaptively over online data streams. In Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '03, pages\u00a0487\u2013492, New York, NY, USA, 2003. ACM.","DOI":"10.1145\/956804.956807"},{"issue":"5","key":"9_CR15","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1177\/0165551505055405","volume":"31","author":"Joong Hyuk Chang","year":"2005","unstructured":"Joong Hyuk Chang and Won Suk Lee. Efficient mining method for retrieving sequential patterns over online data streams. J. Inf. Sci., 31(5):420\u2013432, October 2005.","journal-title":"J. Inf. Sci"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Lei Chang, Tengjiao Wang, Dongqing Yang, and Hua Luan. Seqstream: Mining closed sequential patterns over stream sliding windows. In Proceedings of the 2008 Eighth IEEE International Conference on Data Mining, ICDM '08, pages\u00a083\u201392, Washington, DC, USA, 2008. IEEE Computer Society.","DOI":"10.1109\/ICDM.2008.36"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Moses Charikar, Kevin Chen, and Martin Farach-Colton. Finding frequent items in data streams. In Automata, Languages and Programming, pages\u00a0693\u2013703. Springer, 2002.","DOI":"10.1007\/3-540-45465-9_59"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Bin Chen, Peter Haas, and Peter Scheuermann. A new two-phase sampling based algorithm for discovering association rules. In Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '02, pages\u00a0462\u2013468, New York, NY, USA, 2002. ACM.","DOI":"10.1145\/775047.775114"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Junbo Chen and ShanPing Li. Gc-tree:a fast online algorithm for mining frequent closed itemsets. In Emerging Technologies in Knowledge Discovery and Data Mining, pages\u00a0457\u2013468. Springer, 2007.","DOI":"10.1007\/978-3-540-77018-3_45"},{"issue":"3","key":"9_CR20","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10844-007-0042-3","volume":"31","author":"James Cheng","year":"2008","unstructured":"James Cheng, Yiping Ke, and Wilfred Ng. Maintaining frequent closed itemsets over a sliding window. Journal of Intelligent Information Systems, 31(3):191\u2013215, 2008.","journal-title":"Journal of Intelligent Information Systems"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"William Cheung and Osmar R Zaiane. Incremental mining of frequent patterns without candidate generation or support constraint. In Database Engineering and Applications Symposium, 2003. Proceedings. Seventh International, pages\u00a0111\u2013116. IEEE, 2003.","DOI":"10.1109\/IDEAS.2003.1214917"},{"key":"9_CR22","unstructured":"D.W. Cheung, J. Han, V. Ng, and C.Y. Wong. Maintenance of discovered association rules in large databases: An incremental updating techniques. In Proc. 12th IEEE International Conference on Data Engineering (ICDE-96), New Orleans, Louisiana, U.S.A., March 1, 1996."},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Yun Chi, Haixun Wang, Philip S. Yu, and Richard R. Muntz. Moment: Maintaining closed frequent itemsets over a stream sliding window. In Proceedings of the Fourth IEEE International Conference on Data Mining, ICDM '04, pages\u00a059\u201366, Washington, DC, USA, 2004. IEEE Computer Society.","DOI":"10.1109\/ICDM.2004.10084"},{"issue":"1","key":"9_CR24","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.jalgor.2003.12.001","volume":"55","author":"Graham Cormode","year":"2005","unstructured":"Graham Cormode and S. Muthukrishnan. An improved data stream summary: The count-min sketch and its applications. J. Algorithms, 55(1):58\u201375, April 2005.","journal-title":"J. Algorithms"},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"Erik D. Demaine, Alejandro L\u00f3pez-Ortiz, and J. Ian Munro. Frequency estimation of internet packet streams with limited space. In Proceedings of the 10th Annual European Symposium on Algorithms, ESA '02, pages\u00a0348\u2013360, London, UK, UK, 2002. Springer-Verlag.","DOI":"10.1007\/3-540-45749-6_33"},{"issue":"1","key":"9_CR26","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10618-005-0248-3","volume":"10","author":"C. I. Ezeife","year":"2005","unstructured":"C. I. Ezeife and Yi Lu. Mining web log sequential patterns with position coded pre-order linked wap-tree. Data Min. Knowl. Discov., 10(1):5\u201338, January 2005.","journal-title":"Data Min. Knowl. Discov"},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"CI Ezeife and Mostafa Monwar. Ssm: a frequent sequential data stream patterns miner. In Computational Intelligence and Data Mining, 2007. CIDM 2007. IEEE Symposium on, pages\u00a0120\u2013126. IEEE, 2007.","DOI":"10.1109\/CIDM.2007.368862"},{"key":"9_CR28","first-page":"191","volume":"212","author":"Chris Giannella","year":"2003","unstructured":"Chris Giannella, Jiawei Han, Jian Pei, Xifeng Yan, and Philip S Yu. Mining frequent patterns in data streams at multiple time granularities. Next generation data mining, 212:191\u2013212, 2003.","journal-title":"Next generation data mining"},{"key":"9_CR29","doi-asserted-by":"crossref","unstructured":"Phillip B. Gibbons and Yossi Matias. New Sampling-Based Summary Statistics for Improving Approximate Query Answers. In Proc. of the 1998 ACM SIGMOD, pages\u00a0331\u2013342. ACM Press, June 1998.","DOI":"10.1145\/276305.276334"},{"key":"9_CR30","doi-asserted-by":"crossref","unstructured":"Bart Goethals and Mohammed J. Zaki. Workshop Report on Workshop on Frequent Itemset Mining Implementations (FIMI). 2003.","DOI":"10.1145\/1007730.1007744"},{"key":"9_CR31","doi-asserted-by":"crossref","unstructured":"Anamika Gupta, Vasudha Bhatnagar, and Naveen Kumar. Mining closed itemsets in data stream using formal concept analysis. In Proceedings of the 12th international conference on Data warehousing and knowledge discovery, DaWaK'10, pages\u00a0285\u2013296, Berlin, Heidelberg, 2010. Springer-Verlag.","DOI":"10.1007\/978-3-642-15105-7_23"},{"key":"9_CR32","doi-asserted-by":"crossref","unstructured":"J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proceedings of the ACM SIGMOD Conference on Management of Data, 2000.","DOI":"10.1145\/342009.335372"},{"issue":"1","key":"9_CR33","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10618-006-0059-1","volume":"15","author":"Jiawei Han","year":"2007","unstructured":"Jiawei Han, Hong Cheng, Dong Xin, and Xifeng Yan. Frequent pattern mining: current status and future directions. Data Mining and Knowledge Discovery, 15(1):55\u201386, 2007.","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"1","key":"9_CR34","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10115-012-0581-y","volume":"37","author":"Chandima HewaNadungodage","year":"2013","unstructured":"Chandima HewaNadungodage, Yuni Xia, Jaehwan John Lee, and Yi-cheng Tu. Hyper-structure mining of frequent patterns in uncertain data streams. Knowledge and Information Systems, 37(1):219\u2013244, 2013.","journal-title":"Knowledge and Information Systems"},{"key":"9_CR35","doi-asserted-by":"crossref","unstructured":"C. Hidber. Online Association Rule Mining. In Proceedings of ACM SIGMOD Conference on Management of Data, pages\u00a0145\u2013156. ACM Press, 1999.","DOI":"10.1145\/304181.304195"},{"key":"9_CR36","doi-asserted-by":"crossref","unstructured":"Jochen Hipp, Ulrich G\u00fcntzer, and Gholamreza Nakhaeizadeh. Algorithms for association rule mining\u2014a general survey and comparison. SIGKDD Explor. Newsl., 2(1):58\u201364, June 2000.","DOI":"10.1145\/360402.360421"},{"key":"9_CR37","doi-asserted-by":"crossref","unstructured":"Jun Huan, Wei Wang, Deepak Bandyopadhyay, Jack Snoeyink, Jan Prins, and Alexander Tropsha. Mining protein family-specific residue packing patterns from protein structure graphs. In Eighth International Conference on Research in Computational Molecular Biology (RECOMB), pages\u00a0308\u2013315, 2004.","DOI":"10.1145\/974614.974655"},{"key":"9_CR38","doi-asserted-by":"crossref","unstructured":"Akihiro Inokuchi, Takashi Washio, and Hiroshi Motoda. An apriori-based algorithm for mining frequent substructures from graph data. In Principles of Knowledge Discovery and Data Mining (PKDD2000), pages\u00a013\u201323, 2000.","DOI":"10.1007\/3-540-45372-5_2"},{"key":"9_CR39","doi-asserted-by":"crossref","unstructured":"Nan Jiang and Le Gruenwald. Cfi-stream: mining closed frequent itemsets in data streams. In Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '06, pages\u00a0592\u2013597, New York, NY, USA, 2006. ACM.","DOI":"10.1145\/1150402.1150473"},{"key":"9_CR40","doi-asserted-by":"crossref","unstructured":"Ruoming Jin and Gagan Agrawal. An algorithm for in-core frequent itemset mining on streaming data. In Proceedings of the Fifth IEEE International Conference on Data Mining, ICDM '05, pages\u00a0210\u2013217, Washington, DC, USA, 2005. IEEE Computer Society.","DOI":"10.1109\/ICDM.2005.21"},{"key":"9_CR41","unstructured":"Ruoming Jin, Chao Wang, Dmitrii Polshakov, Srini Parthasarathy, and Gagan Agrawal. Discovering frequent topological structures from graph datasets. In KDD, 2005."},{"key":"9_CR42","unstructured":"Richard M. Karp, Christos H. Papadimitrious, and Scott Shanker. A Simple Algorithm for Finding Frequent Elements in Streams and Bags. Available from http:\/\/www.cs.berkeley.edu\/christos\/iceberg.ps , 2002."},{"key":"9_CR43","doi-asserted-by":"crossref","unstructured":"Adam Koper and Hung Son Nguyen. Sequential pattern mining from stream data. In Advanced Data Mining and Applications, pages\u00a0278\u2013291. Springer, 2011.","DOI":"10.1007\/978-3-642-25856-5_21"},{"key":"9_CR44","doi-asserted-by":"crossref","unstructured":"Michihiro Kuramochi and George Karypis. Frequent subgraph discovery. In ICDM '01: Proceedings of the 2001 IEEE International Conference on Data Mining, pages\u00a0313\u2013320, 2001.","DOI":"10.1109\/ICDM.2001.989534"},{"key":"9_CR45","unstructured":"Daesu Lee and Wonsuk Lee. Finding maximal frequent itemsets over online data streams adaptively. In Data Mining, Fifth IEEE International Conference on, pages\u00a08\u2013pp. IEEE, 2005."},{"key":"9_CR46","doi-asserted-by":"crossref","unstructured":"CK-S Leung and Boyu Hao. Mining of frequent itemsets from streams of uncertain data. In Data Engineering, 2009. ICDE'09. IEEE 25th International Conference on, pages\u00a01663\u20131670. IEEE, 2009.","DOI":"10.1109\/ICDE.2009.157"},{"key":"9_CR47","doi-asserted-by":"crossref","unstructured":"Carson Kai-Sang Leung and Fan Jiang. Frequent itemset mining of uncertain data streams using the damped window model. In Proceedings of the 2011 ACM Symposium on Applied Computing, SAC '11, pages\u00a0950\u2013955, New York, NY, USA, 2011. ACM.","DOI":"10.1145\/1982185.1982393"},{"key":"9_CR48","doi-asserted-by":"crossref","unstructured":"Carson Kai-Sang Leung and Fan Jiang. Frequent pattern mining from time-fading streams of uncertain data. In Data Warehousing and Knowledge Discovery, pages\u00a0252\u2013264. Springer, 2011.","DOI":"10.1007\/978-3-642-23544-3_19"},{"issue":"2","key":"9_CR49","doi-asserted-by":"publisher","first-page":"1466","DOI":"10.1016\/j.eswa.2007.11.061","volume":"36","author":"Hua-Fu Li","year":"2009","unstructured":"Hua-Fu Li and Suh-Yin Lee. Mining frequent itemsets over data streams using efficient window sliding techniques. Expert Systems with Applications, 36(2):1466\u20131477, 2009.","journal-title":"Expert Systems with Applications"},{"key":"9_CR50","doi-asserted-by":"crossref","unstructured":"Haifeng Li and Ning Zhang. A false negative maximal frequent itemset mining algorithm over stream. In Advanced Data Mining and Applications, pages\u00a029\u201341. Springer, 2011.","DOI":"10.1007\/978-3-642-25853-4_3"},{"key":"9_CR51","doi-asserted-by":"crossref","unstructured":"Wenmin Li, Jiawei Han, and Jian Pei. Cmar: Accurate and efficient classification based on multiple class-association rules. In Proceedings of the 2001 IEEE International Conference on Data Mining, ICDM '01, pages\u00a0369\u2013376, Washington, DC, USA, 2001. IEEE Computer Society.","DOI":"10.1109\/ICDM.2001.989541"},{"key":"9_CR52","unstructured":"Hua-Fu Li, Suh-Yin Lee, and Man-Kwan Shan. An efficient algorithm for mining frequent itemsets over the entire history of data streams. In Proc. of First International Workshop on Knowledge Discovery in Data Streams, 2004."},{"key":"9_CR53","doi-asserted-by":"crossref","unstructured":"Hua-Fu Li, Suh-Yin Lee, and Man-Kwan Shan. Online mining (recently) maximal frequent itemsets over data streams. In Research Issues in Data Engineering: Stream Data Mining and Applications, 2005. RIDE-SDMA 2005. 15th International Workshop on, pages\u00a011\u201318. IEEE, 2005.","DOI":"10.1109\/RIDE.2005.13"},{"key":"9_CR54","doi-asserted-by":"crossref","unstructured":"Hua-Fu Li, Man-Kwan Shan, and Suh-Yin Lee. Online mining of frequent query trees over xml data streams. In Proceedings of the 15th international conference on World Wide Web, pages\u00a0959\u2013960. ACM, 2006.","DOI":"10.1145\/1135777.1135964"},{"issue":"1","key":"9_CR55","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10115-007-0112-4","volume":"17","author":"Hua-Fu Li","year":"2008","unstructured":"Hua-Fu Li, Man-Kwan Shan, and Suh-Yin Lee. Dsm-fi: an efficient algorithm for mining frequent itemsets in data streams. Knowledge and Information Systems, 17(1):79\u201397, 2008.","journal-title":"Knowledge and Information Systems"},{"issue":"2","key":"9_CR56","doi-asserted-by":"publisher","first-page":"2451","DOI":"10.1016\/j.eswa.2007.12.054","volume":"36","author":"Hua-Fu Li","year":"2009","unstructured":"Hua-Fu Li, Chin-Chuan Ho, and Suh-Yin Lee. Incremental updates of closed frequent itemsets over continuous data streams. Expert Systems with Applications, 36(2):2451\u20132458, 2009.","journal-title":"Expert Systems with Applications"},{"issue":"1","key":"9_CR57","first-page":"25","volume":"7","author":"Haifeng Li","year":"2012","unstructured":"Haifeng Li, Ning Zhang, and Zhixin Chen. A simple but effective maximal frequent itemset mining algorithm over streams. Journal of Software, 7(1):25\u201332, 2012.","journal-title":"Journal of Software"},{"key":"9_CR58","doi-asserted-by":"crossref","unstructured":"Chih-Hsiang Lin, Ding-Ying Chiu, Yi-Hung Wu, and Arbee L.P. Chen. Mining frequent itemsets from data streams with a time-sensitive sliding window. In Proceedings of the Fifth SIAM International Conference on Data Mining, volume\u00a0119, page 68. SIAM, 2005.","DOI":"10.1137\/1.9781611972757.7"},{"issue":"6","key":"9_CR59","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1016\/j.camwa.2008.10.060","volume":"57","author":"Xuejun Liu","year":"2009","unstructured":"Xuejun Liu, Jihong Guan, and Ping Hu. Mining frequent closed itemsets from a landmark window over online data streams. Comput. Math. Appl., 57(6):927\u2013936, March 2009.","journal-title":"Comput. Math. Appl"},{"key":"9_CR60","doi-asserted-by":"crossref","unstructured":"G. S. Manku and R. Motwani. Approximate Frequency Counts Over Data Streams. In Proceedings of Conference on Very Large DataBases (VLDB), pages\u00a0346\u2013357, September 2002.","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"9_CR61","doi-asserted-by":"crossref","unstructured":"Gurmeet Singh Manku and Rajeev Motwani. Approximate frequency counts over data streams. In Proceedings of the 28th international conference on Very Large Data Bases, VLDB '02, pages\u00a0346\u2013357. VLDB Endowment, 2002.","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"issue":"3","key":"9_CR62","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s10844-006-9954-6","volume":"27","author":"Alice Marascu","year":"2006","unstructured":"Alice Marascu and Florent Masseglia. Mining sequential patterns from data streams: A centroid approach. J. Intell. Inf. Syst., 27(3):291\u2013307, November 2006.","journal-title":"J. Intell. Inf. Syst"},{"issue":"3","key":"9_CR63","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1177\/0165551506068179","volume":"33","author":"Guojun Mao","year":"2007","unstructured":"Guojun Mao, Xindong Wu, Xingquan Zhu, Gong Chen, and Chunnian Liu. Mining maximal frequent itemsets from data streams. Journal of Information Science, 33(3):251\u2013262, 2007.","journal-title":"Journal of Information Science"},{"key":"9_CR64","doi-asserted-by":"crossref","unstructured":"Luiz F. Mendes, Bolin Ding, and Jiawei Han. Stream sequential pattern mining with precise error bounds. In Proceedings of the 2008 Eighth IEEE International Conference on Data Mining, ICDM '08, pages\u00a0941\u2013946, Washington, DC, USA, 2008. IEEE Computer Society.","DOI":"10.1109\/ICDM.2008.154"},{"key":"9_CR65","doi-asserted-by":"crossref","unstructured":"Ahmed Metwally, Divyakant Agrawal, and Amr El Abbadi. Efficient computation of frequent and top-k elements in data streams. In Proceedings of the 10th International Conference on Database Theory, ICDT'05, pages\u00a0398\u2013412, Berlin, Heidelberg, 2005. Springer-Verlag.","DOI":"10.1007\/978-3-540-30570-5_27"},{"key":"9_CR66","doi-asserted-by":"crossref","unstructured":"Jayadev Misra and David Gries. Finding repeated elements. Technical report, Cornell University, Ithaca, NY, USA, 1982.","DOI":"10.1016\/0167-6423(82)90012-0"},{"key":"9_CR67","unstructured":"Willie Ng and Manoranjan Dash. Efficient approximate mining of frequent patterns over transactional data streams. In Proceedings of the 10th international conference on Data Warehousing and Knowledge Discovery, DaWaK '08, pages\u00a0241\u2013250, Berlin, Heidelberg, 2008. Springer-Verlag."},{"key":"9_CR68","doi-asserted-by":"crossref","unstructured":"Debprakash Patnaik, Srivatsan Laxman, Badrish Chandramouli, and Naren Ramakrishnan. A general streaming algorithm for pattern discovery. Knowledge and Information Systems, pages\u00a01\u201326, 2013.","DOI":"10.1007\/s10115-013-0669-z"},{"key":"9_CR69","unstructured":"Chedy Ra\u00efssi, Pascal Poncelet, and Maguelonne Teisseire. Need for SPEED: Mining sequential patterns in data streams. BDA'05: Bases de donn\u00e9es Avan\u00e9es Actes, 2005."},{"issue":"1","key":"9_CR70","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10844-006-0002-3","volume":"28","author":"Chedy Ra\u00efssi","year":"2007","unstructured":"Chedy Ra\u00efssi, Pascal Poncelet, and Maguelonne Teisseire. Towards a new approach for mining frequent itemsets on data stream. Journal of Intelligent Information Systems, 28(1):23\u201336, 2007.","journal-title":"Journal of Intelligent Information Systems"},{"issue":"22","key":"9_CR71","doi-asserted-by":"publisher","first-page":"3843","DOI":"10.1016\/j.ins.2009.07.012","volume":"179","author":"Syed Khairuzzaman Tanbeer","year":"2009","unstructured":"Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed, Byeong-Soo Jeong, and Young-Koo Lee. Sliding window-based frequent pattern mining over data streams. Information sciences, 179(22):3843\u20133865, 2009.","journal-title":"Information sciences"},{"key":"9_CR72","doi-asserted-by":"crossref","unstructured":"Wei-Guang Teng, Ming-Syan Chen, and Philip S. Yu. A regression-based temporal pattern mining scheme for data streams. In Proceedings of the 29th international conference on Very large data bases-Volume 29, VLDB '03, pages\u00a093\u2013104. VLDB Endowment, 2003.","DOI":"10.1016\/B978-012722442-8\/50017-3"},{"key":"9_CR73","unstructured":"H. Toivonen. Sampling large databases for association rules. In Proc. of the 22nd VLDM Conference., 1996."},{"issue":"2","key":"9_CR74","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s10618-006-0042-x","volume":"13","author":"Raymond Chi-Wing Wong","year":"2006","unstructured":"Raymond Chi-Wing Wong and Ada Wai-Chee Fu. Mining top-k frequent itemsets from data streams. Data Mining and Knowledge Discovery, 13(2):193\u2013217, 2006.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"9_CR75","unstructured":"Dong Xin, Jiawei Han, Xifeng Yan, and Hong Cheng. Mining compressed frequent-pattern sets. In VLDB, 2005."},{"key":"9_CR76","unstructured":"Xifeng Yan and Jiawei Han. gspan: Graph-based substructure pattern mining. In ICDM '02: Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM'02), page 721, 2002."},{"key":"9_CR77","doi-asserted-by":"crossref","unstructured":"Jeffery Xu Yu, Zhihong Chong, Hongjun Lu, and Aoying Zhou.Li False positive or false negative: mining frequent itemsets from high speed transactional data streams. In Proceedings of the Thirtieth international conference on Very large data bases-Volume 30, VLDB '04, pages\u00a0204\u2013215. VLDB Endowment, 2004.","DOI":"10.1016\/B978-012088469-8\/50021-8"},{"key":"9_CR78","doi-asserted-by":"crossref","unstructured":"Mohammed J. Zaki. Efficiently mining frequent trees in a forest. In KDD '02: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, pages\u00a071\u201380, 2002.","DOI":"10.1145\/775047.775058"},{"key":"9_CR79","doi-asserted-by":"crossref","unstructured":"M. J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New algorithms for fast discovery of association rules. In 3rd Intl. Conf. on Knowledge Discovery and Data Mining., August 1997.","DOI":"10.1007\/978-1-4615-5669-5_1"},{"key":"9_CR80","unstructured":"Mohammed J. Zaki and Charu C. Aggarwal. Xrules: an effective structural classifier for xml data. In KDD '03: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pages\u00a0316\u2013325, 2003."}],"container-title":["Frequent Pattern Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07821-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T11:33:55Z","timestamp":1746358435000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07821-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319078205","9783319078212"],"references-count":80,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07821-2_9","relation":{},"subject":[],"published":{"date-parts":[[2014]]}}}