{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T07:13:12Z","timestamp":1725606792817},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642238628"},{"type":"electronic","value":"9783642238635"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23863-5_53","type":"book-chapter","created":{"date-parts":[[2011,9,10]],"date-time":"2011-09-10T12:50:22Z","timestamp":1315659022000},"page":"515-523","source":"Crossref","is-referenced-by-count":3,"title":["An Efficient Itemset Mining Approach for Data Streams"],"prefix":"10.1007","author":[{"given":"Elena","family":"Baralis","sequence":"first","affiliation":[]},{"given":"Tania","family":"Cerquitelli","sequence":"additional","affiliation":[]},{"given":"Silvia","family":"Chiusano","sequence":"additional","affiliation":[]},{"given":"Alberto","family":"Grand","sequence":"additional","affiliation":[]},{"given":"Luigi","family":"Grimaudo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"53_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, N., Imielinski, T., Swami, A.: Database mining: A performance perspective. IEEE Trans. on Knowledge and data Engineering\u00a05(6) (1993)","DOI":"10.1109\/69.250074"},{"key":"53_CR2","unstructured":"Aumann, Y., Feldman, R., Lipshtat, O.: Borders: An efficient algorithm for association generation in dynamic databases. JIIS\u00a012 (1999)"},{"key":"53_CR3","first-page":"389","volume":"25","author":"E. Baralis","year":"2010","unstructured":"Baralis, E., Cerquitelli, T., Chiusano, S.: Constrained itemset mining on a sequence of incoming data blocks. Int. J. Intell. Syst.\u00a025, 389\u2013410 (2010)","journal-title":"Int. J. Intell. Syst."},{"key":"53_CR4","doi-asserted-by":"crossref","unstructured":"Baralis, E., Cerquitelli, T., Chiusano, S., Grand, A.: Array-tree: A persistent data structure to compactly store frequent itemsets. In: IEEE Conf. of Intelligent Systems, pp. 108\u2013113 (2010)","DOI":"10.1109\/IS.2010.5548388"},{"key":"53_CR5","first-page":"106","volume-title":"ICDE","author":"D.W.-L. Cheung","year":"1996","unstructured":"Cheung, D.W.-L., Han, J., Ng, V., Wong, C.Y.: Maintenance of discovered association rules in large databases: An incremental updating technique. In: ICDE, pp. 106\u2013114. IEEE Computer Society, Los Alamitos (1996)"},{"key":"53_CR6","doi-asserted-by":"crossref","unstructured":"Cheung, W., Zaiane, O.R.: Incremental mining of frequent patterns without candidate generation or support constraint. In: IDEAS, pp. 111\u2013116 (July 2003)","DOI":"10.1109\/IDEAS.2003.1214917"},{"issue":"1","key":"53_CR7","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1109\/69.908980","volume":"13","author":"V. Ganti","year":"2001","unstructured":"Ganti, V., Gehrke, J., Ramakrishnan, R.: DEMON: Mining and monitoring evolving data. IEEE Trans. Knowl. Data Eng.\u00a013(1), 50\u201363 (2001)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"53_CR8","doi-asserted-by":"crossref","unstructured":"Ganti, V., Gehrke, J.E., Ramakrishnan, R.: Mining data streams under block evolution. SIGKDD Explorations\u00a03(2) (January 2002)","DOI":"10.1145\/507515.507517"},{"key":"53_CR9","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1109\/ICDM.2001.989514","volume-title":"ICDM 2001: Proceedings of the 2001 IEEE International Conference on Data Mining","author":"K. Gouda","year":"2001","unstructured":"Gouda, K., Zaki, M.J.: Efficiently mining maximal frequent itemsets. In: ICDM 2001: Proceedings of the 2001 IEEE International Conference on Data Mining, pp. 163\u2013170. IEEE Computer Society, Washington, DC, USA (2001)"},{"key":"53_CR10","unstructured":"Grahne, G., Zhu, J.: Efficiently using prefix-trees in mining frequent itemsets. In: FIMI 2003 Workshop on Frequent Itemset Mining Implementations (November 2003)"},{"key":"53_CR11","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: In SIGMOD 2000, Dallas, TX (May 2000)","DOI":"10.1145\/342009.335372"},{"key":"53_CR12","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1109\/FSKD.2008.255","volume-title":"Proceedings of the 2008 Fifth International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2008","author":"K. Li","year":"2008","unstructured":"Li, K., Wang, Y.-y., Ellahi, M., Wang, H.-a.: Mining recent frequent itemsets in data streams. In: Proceedings of the 2008 Fifth International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2008, vol.\u00a004, pp. 353\u2013358. IEEE Computer Society, Washington, DC, USA (2008)"},{"key":"53_CR13","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1109\/ICICTA.2008.227","volume-title":"Proceedings of the 2008 International Conference on Intelligent Computation Technology and Automation","author":"H. Liu","year":"2008","unstructured":"Liu, H., Lin, S., Qiao, J., Yu, G., Lu, K.: An efficient frequent pattern mining algorithm for data stream. In: Proceedings of the 2008 International Conference on Intelligent Computation Technology and Automation, vol.\u00a001, pp. 757\u2013761. IEEE Computer Society, Washington, DC, USA (2008)"},{"issue":"3","key":"53_CR14","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1023\/B:DAMI.0000023674.74932.4c","volume":"8","author":"J. Pei","year":"2004","unstructured":"Pei, J., Han, J., Lakshmanan, L.V.S.: Pushing convertible constraints in frequent itemset mining. Data Min. Knowl. Discov.\u00a08(3), 227\u2013252 (2004)","journal-title":"Data Min. Knowl. Discov."},{"key":"53_CR15","unstructured":"F.\u00a0repository, http:\/\/fimi.cs.helsinki.fi\/"},{"key":"53_CR16","doi-asserted-by":"crossref","unstructured":"Uno, T., Kiyomi, M., Arimura, H.: LCM ver. 2: Efficient mining algorithms for frequent\/closed\/maximal itemsets. In: FIMI (2004)","DOI":"10.1145\/1133905.1133916"},{"key":"53_CR17","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1145\/956750.956779","volume-title":"KDD 2003: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"J. Wang","year":"2003","unstructured":"Wang, J., Han, J., Pei, J.: Closet+: searching for the best strategies for mining frequent closed itemsets. In: KDD 2003: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 236\u2013245. ACM, New York (2003)"},{"key":"53_CR18","doi-asserted-by":"crossref","unstructured":"Wang, Y., Li, K., Wang, H.: Maintaining only frequent itemsets to mine approximate frequent itemsets over online data streams. In: IEEE Symposium on Computational Intelligence and Data Mining, pp. 381\u2013388 (2009)","DOI":"10.1109\/CIDM.2009.4938675"},{"key":"53_CR19","doi-asserted-by":"crossref","unstructured":"Yang, C.-H., Yang, D.-L.: Imbt-a binary tree for efficient support counting of incremental data mining. In: CSE (1), pp. 324\u2013329 (2009)","DOI":"10.1109\/CSE.2009.360"}],"container-title":["Lecture Notes in Computer Science","Knowlege-Based and Intelligent Information and Engineering Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23863-5_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,4]],"date-time":"2021-12-04T07:22:13Z","timestamp":1638602533000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23863-5_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642238628","9783642238635"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23863-5_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}