{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T18:15:11Z","timestamp":1725732911463},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385612"},{"type":"electronic","value":"9783642385629"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38562-9_5","type":"book-chapter","created":{"date-parts":[[2013,6,20]],"date-time":"2013-06-20T15:14:18Z","timestamp":1371741258000},"page":"51-57","source":"Crossref","is-referenced-by-count":6,"title":["Mining Frequent Itemsets from Sparse Data Streams in Limited Memory Environments"],"prefix":"10.1007","author":[{"given":"Juan J.","family":"Cameron","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfredo","family":"Cuzzocrea","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fan","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carson K.","family":"Leung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: VLDB 1994, pp. 487\u2013499 (1994)"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Buehrer, G., Parthasarathy, S., Ghoting, A.: Out-of-core frequent pattern mining on a commodity. In: ACM KDD 2006, pp. 86\u201395 (2006)","DOI":"10.1145\/1150402.1150416"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Cameron, J.J., Cuzzocrea, A., Leung, C.K.-S.: Stream mining of frequent sets with limited memory. In: ACM SAC 2013, pp. 173\u2013175 (2013)","DOI":"10.1145\/2480362.2480398"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-642-32281-5_30","volume-title":"Web-Age Information Management","author":"K. Cao","year":"2012","unstructured":"Cao, K., Wang, G., Han, D., Ma, Y., Ma, X.: A framework for high-quality clustering uncertain data stream over sliding windows. In: Gao, H., Lim, L., Wang, W., Li, C., Chen, L. (eds.) WAIM 2012. LNCS, vol.\u00a07418, pp. 308\u2013313. Springer, Heidelberg (2012)"},{"issue":"1","key":"5_CR5","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s00778-008-0100-7","volume":"18","author":"D.Y. Chiu","year":"2009","unstructured":"Chiu, D.Y., Wu, Y.H., Chen, A.: Efficient frequent sequence mining by a dynamic strategy switching algorithm. VLDB J.\u00a018(1), 303\u2013327 (2009)","journal-title":"VLDB J."},{"key":"5_CR6","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-642-37453-1_4","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"A. Fariha","year":"2013","unstructured":"Fariha, A., Ahmed, C.F., Leung, C.K.-S., Abdullah, S.M., Cao, L.: Mining frequent patterns from human interactions in meetings using directed acyclic graphs. In: Pei, J., Tseng, V.S., Cao, L., Motoda, H., Xu, G. (eds.) PAKDD 2013, Part I. LNCS (LNAI), vol.\u00a07818, pp. 38\u201349. Springer, Heidelberg (2013)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Gao, C., Wang, J., Yang, Q.: Efficient mining of closed sequential patterns on stream sliding window. In: IEEE ICDM 2011, pp. 1044\u20131049 (2011)","DOI":"10.1109\/ICDM.2011.61"},{"key":"5_CR8","unstructured":"Giannella, C., Han, J., Pei, J., Yan, X., Yu, P.S.: Mining frequent patterns in data streams at multiple time granularities. In: Data Mining: Next Generation Challenges and Future Directions, ch. 6 (2004)"},{"key":"5_CR9","unstructured":"Grahne, G., Zhu, J.: Mining frequent itemsets from secondary memory. In: IEEE ICDM 2004, pp. 91\u201398 (2004)"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: ACM SIGMOD 2000, pp. 1\u201312 (2000)","DOI":"10.1145\/335191.335372"},{"issue":"10","key":"5_CR11","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.1016\/j.datak.2009.04.008","volume":"68","author":"X. Jiang","year":"2009","unstructured":"Jiang, X., Xiong, H., Wang, C., Tan, A.-H.: Mining globally distributed frequent subgraphs in a single labeled graph. DKE\u00a068(10), 1034\u20131058 (2009)","journal-title":"DKE"},{"key":"5_CR12","unstructured":"Jin, R., Agrawal, G.: An algorithm for in-core frequent itemset mining on streaming data. In: IEEE ICDM 2005, pp. 210\u2013217 (2005)"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-540-70504-8_2","volume-title":"Sharing Data, Information and Knowledge","author":"C.K.-S. Leung","year":"2008","unstructured":"Leung, C.K.-S., Brajczuk, D.A.: Efficient mining of frequent itemsets from data streams. In: Gray, A., Jeffery, K., Shao, J. (eds.) BNCOD 2008. LNCS, vol.\u00a05071, pp. 2\u201314. Springer, Heidelberg (2008)"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/978-3-642-37574-3_8","volume-title":"TLDKS VIII","author":"C.K.-S. Leung","year":"2013","unstructured":"Leung, C.K.-S., Cuzzocrea, A., Jiang, F.: Discovering frequent patterns from uncertain data streams with time-fading and landmark models. In: Hameurlain, A., K\u00fcng, J., Wagner, R., Cuzzocrea, A., Dayal, U. (eds.) TLDKS VIII. LNCS, vol.\u00a07790, pp. 174\u2013196. Springer, Heidelberg (2013)"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1007\/978-3-642-37487-6_33","volume-title":"DASFAA 2013","author":"C.K.-S. Leung","year":"2013","unstructured":"Leung, C.K.-S., Hayduk, Y.: Mining frequent patterns from uncertain data with mapReduce for big data analytics. In: Meng, W., Feng, L., Bressan, S., Winiwarter, W., Song, W. (eds.) DASFAA 2013, Part I. LNCS, vol.\u00a07825, pp. 440\u2013455. Springer, Heidelberg (2013)"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Leung, C.K.-S., Khan, Q.I.: DSTree: a tree structure for the mining of frequent sets from data streams. In: IEEE ICDM 2006, pp. 928\u2013932 (2006)","DOI":"10.1109\/ICDM.2006.62"},{"key":"5_CR17","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-642-37453-1_2","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"C.K.-S. Leung","year":"2013","unstructured":"Leung, C.K.-S., Tanbeer, S.K.: PUF-tree: a compact tree structure for frequent pattern mining of uncertain data. In: Pei, J., Tseng, V.S., Cao, L., Motoda, H., Xu, G. (eds.) PAKDD 2013, Part I. LNCS (LNAI), vol.\u00a07818, pp. 13\u201325. Springer, Heidelberg (2013)"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-32281-5_8","volume-title":"Web-Age Information Management","author":"J.-F. Qu","year":"2012","unstructured":"Qu, J.-F., Liu, M.: A high-performance algorithm for frequent itemset mining. In: Gao, H., Lim, L., Wang, W., Li, C., Chen, L. (eds.) WAIM 2012. LNCS, vol.\u00a07418, pp. 71\u201382. Springer, Heidelberg (2012)"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Papapetrou, O., Garofalakis, M., Deligiannakis, A.: Sketch-based querying of distributed sliding-window data streams. In: VLDB 2012, pp. 992\u20131003 (2012)","DOI":"10.14778\/2336664.2336672"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-642-37401-2_31","volume-title":"Web Technologies and Applications","author":"S.K. Tanbeer","year":"2013","unstructured":"Tanbeer, S.K., Leung, C.K.-S.: Finding diverse friends in social networks. In: Ishikawa, Y., Li, J., Wang, W., Zhang, R., Zhang, W. (eds.) APWeb 2013. LNCS, vol.\u00a07808, pp. 301\u2013309. Springer, Heidelberg (2013)"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Tirthapura, S., Woodruff, D.P.: A general method for estimating correlated aggregates over a data stream. In: IEEE ICDE 2012, pp. 162\u2013173 (2012)","DOI":"10.1109\/ICDE.2012.62"}],"container-title":["Lecture Notes in Computer Science","Web-Age Information Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38562-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T09:46:22Z","timestamp":1557827182000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38562-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385612","9783642385629"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38562-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}