{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:59:30Z","timestamp":1725487170933},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734505"},{"type":"electronic","value":"9783540734512"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73451-2_51","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:12:14Z","timestamp":1184602334000},"page":"485-494","source":"Crossref","is-referenced-by-count":2,"title":["Memory Efficient Algorithm for Mining Recent Frequent Items in a Stream"],"prefix":"10.1007","author":[{"given":"Piotr","family":"Ko\u0142aczkowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"51_CR1","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.comnet.2005.02.008","volume":"50","author":"K. Lan","year":"2006","unstructured":"Lan, K., Heidemann, J.: A measurement study of correlations of internet flow characteristics. Comput. Networks\u00a050(1), 46\u201362 (2006)","journal-title":"Comput. Networks"},{"key":"51_CR2","unstructured":"Boyer, R.S., Moore, J.S.: MJRTY: A fast majority vote algorithm. Technical Report\u00a035, Institute of Computer Science, Texas University (1981)"},{"key":"51_CR3","doi-asserted-by":"crossref","unstructured":"Misra, J., Gries, D.: Finding repeated elements. Technical report, Cornell University, Ithaca, NY, USA (1982)","DOI":"10.1016\/0167-6423(82)90012-0"},{"key":"51_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/3-540-45749-6_33","volume-title":"Algorithms - ESA 2002","author":"E.D. Demaine","year":"2002","unstructured":"Demaine, E.D., L\u00f3pez-Ortiz, A., Munro, J.I.: Frequency estimation of internet packet streams with limited space. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 348\u2013360. Springer, Heidelberg (2002)"},{"key":"51_CR5","doi-asserted-by":"crossref","unstructured":"Manku, G., Motwani, R.: Approximate frequency counts over data streams. In: Proceedings of the 28th International Conference on Very Large Data Bases, Hong Kong, China (August 2002)","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"51_CR6","doi-asserted-by":"crossref","unstructured":"Charikar, M., Chen, K., Farach-Colton, M.: Finding frequent items in data streams. In: Proceedings of the 29th International Colloquium on Automata, Languages, and Programming (2002)","DOI":"10.1007\/3-540-45465-9_59"},{"issue":"3","key":"51_CR7","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1145\/859716.859719","volume":"21","author":"C. Estan","year":"2003","unstructured":"Estan, C., Varghese, G.: New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice. ACM Trans. Comput. Syst.\u00a021(3), 270\u2013313 (2003)","journal-title":"ACM Trans. Comput. Syst."},{"issue":"2","key":"51_CR8","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1177\/0165551505050785","volume":"31","author":"J.H. Chang","year":"2005","unstructured":"Chang, J.H., Lee, W.S.: estWin: Online data stream mining of recent frequent itemsets by sliding window method. J. Inf. Sci.\u00a031(2), 76\u201390 (2005)","journal-title":"J. Inf. Sci."},{"issue":"1","key":"51_CR9","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1145\/1061318.1061325","volume":"30","author":"G. Cormode","year":"2005","unstructured":"Cormode, G., Muthukrishnan, S.: What\u2019s hot and what\u2019s not: tracking most frequent items dynamically. ACM Trans. Database Syst.\u00a030(1), 249\u2013278 (2005)","journal-title":"ACM Trans. Database Syst."},{"key":"51_CR10","unstructured":"Ko\u0142aczkowski, P.: Using low-pass signal filtering for continuous database load estimation, submitted to BDAS\u201907 conference, Ustro\u0144, Poland (2007)"},{"key":"51_CR11","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1145\/276304.276334","volume-title":"SIGMOD \u201998","author":"P.B. Gibbons","year":"1998","unstructured":"Gibbons, P.B., Matias, Y.: New sampling-based summary statistics for improving approximate query answers. In: SIGMOD \u201998. Proceedings of the 1998 ACM SIGMOD international conference on Management of data, pp. 331\u2013342. ACM Press, New York (1998)"},{"issue":"3","key":"51_CR12","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1109\/12.485571","volume":"45","author":"V. Kantabutra","year":"1996","unstructured":"Kantabutra, V.: On hardware for computing exponential and trigonometric functions. IEEE Trans. Comput.\u00a045(3), 328\u2013339 (1996)","journal-title":"IEEE Trans. Comput."}],"container-title":["Lecture Notes in Computer Science","Rough Sets and Intelligent Systems Paradigms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73451-2_51.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:15:09Z","timestamp":1605762909000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73451-2_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734505","9783540734512"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73451-2_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}