{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:58:06Z","timestamp":1742396286528},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540253341"},{"type":"electronic","value":"9783540320050"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"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":[[2005]]},"DOI":"10.1007\/11408079_38","type":"book-chapter","created":{"date-parts":[[2010,12,20]],"date-time":"2010-12-20T20:38:10Z","timestamp":1292877490000},"page":"422-434","source":"Crossref","is-referenced-by-count":4,"title":["False-Negative Frequent Items Mining from Data Streams with Bursting"],"prefix":"10.1007","author":[{"given":"Zhihong","family":"Chong","sequence":"first","affiliation":[]},{"given":"Jeffrey Xu","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Hongjun","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Zhengjie","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Aoying","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"38_CR1","doi-asserted-by":"crossref","unstructured":"Charikar, M., Chen, K., Farach-Colton, M.: Finding frequent items in data streams. In: Proc. of the 29th ICALP (2002)","DOI":"10.1007\/3-540-45465-9_59"},{"key":"38_CR2","doi-asserted-by":"crossref","unstructured":"Cormode, G., Muthukrishnan, S.: What\u2019s hot and what\u2019s not: Tracking most frequent items dynamically. In: Proc. of PODS 2003 (2003)","DOI":"10.1145\/773153.773182"},{"key":"38_CR3","doi-asserted-by":"crossref","unstructured":"Demaine, E., L\u00f3pez-Ortiz, A., Munro, J.I.: Frequency estimation of internet packet streams with limited space. In: Proc. of 10th Annual European Symposium on Algorithms (2002)","DOI":"10.1007\/3-540-45749-6_33"},{"key":"38_CR4","doi-asserted-by":"crossref","unstructured":"Manku, G.S., Motwani, R.: Approximate frequency counts over data streams. In: Proc. of VLDB 2002 (2002)","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"38_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/762471.762473","volume":"28","author":"S.S.R.M. Karp","year":"2003","unstructured":"Karp, S.S.R.M., Papadimitrlou, C.H.: A simple algorithm for finding frequent elements in streams and bags. ACM Transactions on Database Systems\u00a028, 51\u201355 (2003)","journal-title":"ACM Transactions on Database Systems"},{"key":"38_CR6","doi-asserted-by":"crossref","unstructured":"Yu, J.X., Chong, Z., Lu, H., Zhou, A.: False positive or false negative: Mining frequent itemsets from high speed transactional data streams. In: Proc. of VLDB 2004 (2004)","DOI":"10.1016\/B978-012088469-8\/50021-8"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11408079_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T23:30:47Z","timestamp":1558308647000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11408079_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540253341","9783540320050"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/11408079_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}