{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:40Z","timestamp":1725490240390},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734987"},{"type":"electronic","value":"9783540734994"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73499-4_36","type":"book-chapter","created":{"date-parts":[[2007,8,27]],"date-time":"2007-08-27T00:01:39Z","timestamp":1188172899000},"page":"479-489","source":"Crossref","is-referenced-by-count":4,"title":["Mining Maximal Frequent Itemsets in Data Streams Based on FP-Tree"],"prefix":"10.1007","author":[{"given":"Fujiang","family":"Ao","sequence":"first","affiliation":[]},{"given":"Yuejin","family":"Yan","sequence":"additional","affiliation":[]},{"given":"Jian","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Kedi","family":"Huang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"crossref","unstructured":"Babcock, B., Babu, S., Datar, M., Motwani, R., Widom, J.: Models and issues in data stream systems. In: Proc. of the twenty-first ACM SIGMOD-SIGACTSIGART Symposium on Principles of Database Systems\u00a02002, pp. 1\u201316 (2002)","DOI":"10.1145\/543613.543615"},{"key":"36_CR2","unstructured":"Mao, G., Wu, X., Liu, C.: Online Mining of Maximal Frequent Itemsequences from Data Streams. University of Vermont, Computer Science Technical Report, CS-05-07 (2005)"},{"key":"36_CR3","first-page":"11","volume-title":"Proc. of the fifteenth International Workshops on Research Issues in Data Engineering: Stream Data Mining and Applications","author":"H. Li","year":"2005","unstructured":"Li, H., Lee, S., Shan, M.: Online mining (recently) maximal frequent itemsets over data streams. In: Proc. of the fifteenth International Workshops on Research Issues in Data Engineering: Stream Data Mining and Applications, Tokyo, Japan, pp. 11\u201318. IEEE Press, NJ (2005)"},{"key":"36_CR4","first-page":"266","volume-title":"Proc. of the Fifth IEEE International Conference on Data Mining.Houston","author":"D. Lee","year":"2005","unstructured":"Lee, D., Lee, W.: Finding maximal frequent itemsets over online data streams adaptively. In: Proc. of the Fifth IEEE International Conference on Data Mining.Houston, USA, pp. 266\u2013273. IEEE Press, NJ (2005)"},{"key":"36_CR5","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1109\/ICDM.2004.10084","volume-title":"Proc. of the fourth IEEE International Conference on Data Mining","author":"Y. Chi","year":"2004","unstructured":"Chi, Y., Wang, H., Yu, P.S., Muntz, R.: Moment: maintaining closed frequent itemsets over a stream sliding window. In: Proc. of the fourth IEEE International Conference on Data Mining, UK, pp. 59\u201366. IEEE Press, NJ (2004)"},{"key":"36_CR6","unstructured":"Jiang, N., Gruenwald, L.: CFI-Stream: mining closed frequent itemsets in data streams. In: Proc. of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, Philadelphia, PA, USA, 2006, pp. 592\u2013597 (2006)"},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Bayardo, R.: Efficiently mining long patterns from databases. In: ACM SIGMOD Conference (1998)","DOI":"10.1145\/276304.276313"},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Agarwal, R., Aggarwal, C., Prasad, V.: A tree projection algorithm for generation of frequent itemsets. Journal of Parallel and Distributed Computing (2001)","DOI":"10.1006\/jpdc.2000.1693"},{"key":"36_CR9","unstructured":"Gouda, K., Zaki, M.J.: Efficiently Mining Maximal Frequent Itemsets. In: Proc. of the IEEE Int. Conference on Data Mining, San Jose (2001)"},{"issue":"1","key":"36_CR10","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1093\/bioinformatics\/14.1.55","volume":"14","author":"L. Rigoutsos","year":"1998","unstructured":"Rigoutsos, L., Floratos, A.: Combinatorial pattern discovery in biological sequences: The Teiresias algorithm. Bioinformatics\u00a014(1), 55\u201367 (1998)","journal-title":"Bioinformatics"},{"key":"36_CR11","unstructured":"Grahne, G., Zhu, J.: Efficiently Using Prefix-trees in Mining Frequent Itemsets. In: Proc. of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations, November 19, 2003, Melbourne, Florida, USA (2003)"},{"key":"36_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/978-3-540-30549-1_42","volume-title":"AI 2004: Advances in Artificial Intelligence","author":"Y. Yan","year":"2004","unstructured":"Yan, Y., Li, Z., Chen, H.: Fast Mining Maximal Frequent ItemSets Based on FP-Tree. In: Webb, G.I., Yu, X. (eds.) AI 2004. LNCS (LNAI), vol.\u00a03339, pp. 475\u2013487. Springer, Heidelberg (2004)"},{"key":"36_CR13","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1016\/B978-155860869-6\/50039-1","volume-title":"Proc. of the 28th Int\u2019l Conf. on Very Large Data Bases","author":"Y. Zhu","year":"2002","unstructured":"Zhu, Y., Shasha, D.: StatStream: Statistical monitoring of thousands of data streams in real time. In: Bernstein, P., Ioannidis, Y., Ramakrishnan, R. (eds.) Proc. of the 28th Int\u2019l Conf. on Very Large Data Bases, Hong Kong, pp. 358\u2013369. Morgan Kaufmann, Seattle (2002)"},{"key":"36_CR14","unstructured":"Rymon, R.: Search through Systematic Set Enumeration. In: Proc. of Third Int\u2019l Conf. on Principles of Knowledge Representation and Reasoning, pp. 539\u2013550 (1992)"},{"key":"36_CR15","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: SIGMOD 2000. Proc. 2000 ACM-SIGMOD Int. Conf. on Management of Data, May 2000, Dallas, TX (2000)","DOI":"10.1145\/342009.335372"},{"issue":"S1","key":"36_CR16","first-page":"1748","volume":"45","author":"Z. Ma","year":"2005","unstructured":"Ma, Z., Chen, X., Wang, X.: Pruning strategy for mining maximal frequent itemsets. Journal of Tsinghua Univ\u00a045(S1), 1748\u20131752 (2005)","journal-title":"Journal of Tsinghua Univ"},{"key":"36_CR17","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: VLDB 1994. Proc. Of the 20th Intl. Conf. on Very Large Databases, Santiago, Chile, September 1994, pp. 487\u2013499 (1994)"},{"key":"36_CR18","unstructured":"Codes and datasets available at \n                    \n                      http:\/\/fimi.cs.helsinki.fi\/"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Data Mining in Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73499-4_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T10:25:42Z","timestamp":1558261542000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73499-4_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540734987","9783540734994"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73499-4_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}