{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:22:58Z","timestamp":1742980978223,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642006715"},{"type":"electronic","value":"9783642006722"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-00672-2_57","type":"book-chapter","created":{"date-parts":[[2009,3,21]],"date-time":"2009-03-21T17:04:48Z","timestamp":1237655088000},"page":"597-603","source":"Crossref","is-referenced-by-count":2,"title":["A Sliding-Window Approach for Finding Top-k Frequent Itemsets from Uncertain Streams"],"prefix":"10.1007","author":[{"given":"Xiaojian","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huili","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"57_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Yu, P.S.: A Framework for Clustering Uncertain Data Streams. In: Proc. of 34th ICDE, Canc\u00fan, M\u00e9xico, pp. 150\u2013159 (2008)","DOI":"10.1109\/ICDE.2008.4497423"},{"key":"57_CR2","doi-asserted-by":"crossref","unstructured":"Cormode, G., Garofalakis, M.: Sketching Probabilistic Data Streams. In: Proc. of ACM SIGMOD, Beijing, China, pp. 281\u2013292 (2007)","DOI":"10.1145\/1247480.1247513"},{"key":"57_CR3","doi-asserted-by":"crossref","unstructured":"Manku, G., Motwani, R.: Approximate Frequency Counts over Data Streams. In: Proc. of the 28th VLDB, Hong Kong, China, pp. 346\u2013357 (2002)","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"issue":"4","key":"57_CR4","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1214\/aoms\/1177729330","volume":"23","author":"H. Chernoff","year":"1952","unstructured":"Chernoff, H.: A Measure of Asymptotic Efficiency for Tests of a hypothesis Based on the Sum of Observations. The Annals of Mathematical Statistics\u00a023(4), 493\u2013507 (1952)","journal-title":"The Annals of Mathematical Statistics"},{"key":"57_CR5","doi-asserted-by":"crossref","unstructured":"Zim\u00e1nyi, E., Pirotte, A.: Imperfect information in relational databases. In: Uncertainty Management in Information Systems, pp. 35\u201388 (1996)","DOI":"10.1007\/978-1-4615-6245-0_3"},{"key":"57_CR6","first-page":"487","volume-title":"Proc. of the 20th ICDE","author":"R. Agrawal","year":"1994","unstructured":"Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules in Large Databases. In: Proc. of the 20th ICDE, pp. 487\u2013499. Morgan Kaufmann, San Francisco (1994)"}],"container-title":["Lecture Notes in Computer Science","Advances in Data and Web Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00672-2_57","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T15:16:57Z","timestamp":1684941417000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00672-2_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642006715","9783642006722"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00672-2_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}