{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T03:29:30Z","timestamp":1725593370791},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642223389"},{"type":"electronic","value":"9783642223396"}],"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-22339-6_25","type":"book-chapter","created":{"date-parts":[[2011,6,27]],"date-time":"2011-06-27T19:58:48Z","timestamp":1309204728000},"page":"209-216","source":"Crossref","is-referenced-by-count":0,"title":["Using Bloom Filters for Mining Top-k Frequent Itemsets in Data Streams"],"prefix":"10.1007","author":[{"given":"Younghee","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kyungsoo","family":"Cho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaeyeol","family":"Yoon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ieejoon","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ungmo","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"25_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(03)00400-6","volume":"312","author":"M. Charikar","year":"2004","unstructured":"Charikar, M., Chen, K., Farach-Colton, M.: Finding Frequent Items in Data Streams. Theoretical Computer Science\u00a0312(1), 3\u201315 (2004)","journal-title":"Theoretical Computer Science"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Cormode, G., Korn, F., Muthukrishnan, S., Srivastava, D.: Finding Hierarchical Heavy Hitters in Data Streams. In: Proceedings of the 29th VLDB Conference, Berlin, Germany, pp. 464\u2013475 (2003)","DOI":"10.1016\/B978-012722442-8\/50048-3"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-540-30570-5_27","volume-title":"Database Theory - ICDT 2005","author":"A. Metwally","year":"2005","unstructured":"Metwally, A., Agrawal, D., Abbadi, A.E.: Efficient computation of frequent and top-k elements in data streams. In: Eiter, T., Libkin, L. (eds.) ICDT 2005. LNCS, vol.\u00a03363, pp. 398\u2013412. Springer, Heidelberg (2005)"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Theobald, M., Weikum, G., Schenkel, R.: Top-k Query Evaluation with Probabilistic Guarantees. In: Proceedings of the 30th VLDB Conference, Toronto, Canada, pp. 648\u2013659 (2004)","DOI":"10.1016\/B978-012088469-8.50058-9"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/978-3-642-00672-2_57","volume-title":"Advances in Data and Web Management","author":"X. Zhang","year":"2009","unstructured":"Zhang, X., Peng, H.: A Sliding-Window Approach for Finding Top-k Frequent Itemsets from Uncertain Streams. In: Li, Q., Feng, L., Pei, J., Wang, S.X., Zhou, X., Zhu, Q.-M. (eds.) APWeb\/WAIM 2009. LNCS, vol.\u00a05446, pp. 597\u2013603. Springer, Heidelberg (2009)"},{"issue":"5","key":"25_CR6","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1109\/TKDE.2005.81","volume":"17","author":"J. Wang","year":"2005","unstructured":"Wang, J., Han, J.: TFP: An Efficient Algorithm for Mining Top-K Frequent Closed Itemsets. IEEE Transactions on Knowledge and Data Engineering\u00a017(5), 652\u2013664 (2005)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"25_CR7","unstructured":"Vasudevan, D., Vjnovi\u0107, M.: Ranking through Random Sampling (2009) (manuscript)"},{"key":"25_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-540-75488-6_29","volume-title":"Discovery Science","author":"A. Pietracaprina","year":"2007","unstructured":"Pietracaprina, A., Vandin, F.: Efficient Incremental Mining of Top-K Frequent Closed Itemsets. In: Corruble, V., Takeda, M., Suzuki, E. (eds.) DS 2007. LNCS (LNAI), vol.\u00a04755, pp. 275\u2013280. Springer, Heidelberg (2007)"},{"key":"25_CR9","unstructured":"Zhu, Y., Jiang, H.: False Rate Analysis of Bloom Filter Replicas in Distributed Systems. In: Proceeding of the 2006 International Conference on Parallel Processing, pp. 255\u2013262 (2006)"},{"key":"25_CR10","first-page":"254","volume-title":"Proceeding of the ACM SIGCOMM 1998 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication","author":"L. Fan","year":"1998","unstructured":"Fan, L., Cao, P., Almeida, J., Broder, Z.A.: Summary cache: a scalable wide-area web cache sharing protocol. In: Proceeding of the ACM SIGCOMM 1998 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, pp. 254\u2013265. ACM Press, New York (1998)"},{"key":"25_CR11","unstructured":"Han, J., Wang, J., Lu, Y., Tzvetkov, P.: Mining top-k frequent closed patterns without minimum support. In: proceedings of IEEE ICDM Conference on Data Mining, pp. 211\u2013218 (2000)"},{"key":"25_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/11811305_48","volume-title":"Advanced Data Mining and Applications","author":"T.M. Quang","year":"2006","unstructured":"Quang, T.M., Oyanagi, S., Yamazaki, K.: ExMiner: An Efficient Algorithm for Mining Top-K Frequent Patterns. In: Li, X., Za\u00efane, O.R., Li, Z.-h. (eds.) ADMA 2006. LNCS (LNAI), vol.\u00a04093, pp. 436\u2013447. Springer, Heidelberg (2006)"}],"container-title":["Communications in Computer and Information Science","Secure and Trust Computing, Data Management and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22339-6_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T09:35:00Z","timestamp":1553852100000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22339-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642223389","9783642223396"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22339-6_25","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2011]]}}}