{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T22:10:53Z","timestamp":1766441453345},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,4,11]],"date-time":"2014-04-11T00:00:00Z","timestamp":1397174400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Prog Artif Intell"],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1007\/s13748-014-0050-9","type":"journal-article","created":{"date-parts":[[2014,4,10]],"date-time":"2014-04-10T11:48:23Z","timestamp":1397130503000},"page":"15-28","source":"Crossref","is-referenced-by-count":3,"title":["Constructing fading histograms from data streams"],"prefix":"10.1007","volume":"3","author":[{"given":"Raquel","family":"Sebasti\u00e3o","sequence":"first","affiliation":[]},{"given":"Jo\u00e3o","family":"Gama","sequence":"additional","affiliation":[]},{"given":"Teresa","family":"Mendon\u00e7a","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,4,11]]},"reference":[{"key":"50_CR1","unstructured":"Babcock, B., Babu, S., Datar, M., Motwani, R., Widom, J.: Models and issues in data stream systems. In: Proceedings of the 21st ACM SIGMOD\u2013SIGACT\u2013SIGART Symposium on Principles of Database Systems, PODS \u201902, pp. 1\u201316. ACM, New York (2002). doi 10.1145\/543613.543615"},{"key":"50_CR2","doi-asserted-by":"crossref","unstructured":"Barbar, D.: Requirements for clustering data streams. SIGKDD Explor. Newsl. 3(2), 23\u201327 (2002). doi: 10.1145\/507515.507519","DOI":"10.1145\/507515.507519"},{"key":"50_CR3","unstructured":"Chakrabarti, K., Garofalakis, M.N., Rastogi, R., Shim, K.: Approximate query processing using wavelets. In: Abbadi, A.E., Brodie, M.L., Chakravarthy, S., Dayal, U., Kamel, N., Schlageter, G., Whang, K.Y. (eds.) VLDB 2000. Proceedings of 26th International Conference on Very Large Data Bases, 10\u201314 September 2000, Cairo, pp. 111\u2013122. Morgan Kaufmann, Burlington (2000)"},{"key":"50_CR4","doi-asserted-by":"crossref","unstructured":"Cormode, G., Muthukrishnan, S.: An improved data stream summary: the count-min sketch and its applications. J. Algorithms 55(1), 58\u201375 (2005). doi: 10.1016\/j.jalgor.2003.12.001","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"50_CR5","doi-asserted-by":"crossref","unstructured":"Cormode, G., Muthukrishnan, S.: What\u2019s hot and what\u2019s not: tracking most frequent items dynamically. ACM Trans. Database Syst. 30(1), 249\u2013278 (2005). doi: 10.1145\/1061318.1061325","DOI":"10.1145\/1061318.1061325"},{"key":"50_CR6","unstructured":"Correa, M., Bielza, C., Pamies-Teixeira, J.: Comparison of bayesian networks and artificial neural networks for quality detection in a machining process. Expert Syst. Appl. 36(3), 7270\u20137279 (2009). http:\/\/dblp.uni-trier.de\/db\/journals\/eswa\/eswa36.html#CorreaBP09"},{"key":"50_CR7","doi-asserted-by":"crossref","unstructured":"Freedman, D., Diaconis, P.: On the histogram as a density estimator: L2 theory. Probab. Theory Relat. Fields 57(4), 453\u2013476 (1981). doi: 10.1007\/BF01025868","DOI":"10.1007\/BF01025868"},{"issue":"3","key":"50_CR8","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/s10994-012-5320-9","volume":"90","author":"J Gama","year":"2013","unstructured":"Gama, J., Sebastipo, R., Rodrigues, P.P.: On evaluating stream learning algorithms. Mach. Learn. 90(3), 317\u2013346 (2013)","journal-title":"Mach. Learn."},{"key":"50_CR9","unstructured":"Gibbons, P.B., Matias, Y.: Synopsis data structures for massive data sets. In: ACM\u2013SIAM Symposium on Discrete Algorithms, pp. 909\u2013910 (1999). doi: 10.1145\/314500.315083"},{"key":"50_CR10","doi-asserted-by":"crossref","unstructured":"Gilbert, A.C., Kotidis, Y., Muthukrishnan, S., Strauss, M.J.: One-pass wavelet decompositions of data streams. IEEE Trans. Knowl. Data Eng. 15(3), 541\u2013554 (2003). doi: 10.1109\/TKDE.2003.1198389","DOI":"10.1109\/TKDE.2003.1198389"},{"key":"50_CR11","doi-asserted-by":"crossref","unstructured":"Guha, S., Koudas, N., Shim, K.: Approximation and streaming algorithms for histogram construction problems. ACM Trans. Database Syst. 31(1), 396\u2013438 (2006). doi: 10.1145\/1132863.1132873","DOI":"10.1145\/1132863.1132873"},{"key":"50_CR12","doi-asserted-by":"crossref","unstructured":"Guha, S., Shim, K., Woo, J.: Rehist: relative error histogram construction algorithms. In: Proceedings of the 30th International Conference on Very Large Data Bases, pp. 300\u2013311 (2004)","DOI":"10.1016\/B978-012088469-8\/50029-2"},{"key":"50_CR13","unstructured":"Ioannidis, Y.: The history of histograms (abridged). In: VLDB Endowment. Proceedings of the 29th International Conference on Very Large Data Bases, vol. 29, VLDB \u201903, pp. 19\u201330 (2003). http:\/\/dl.acm.org\/citation.cfm?id=1315451.1315455"},{"key":"50_CR14","doi-asserted-by":"crossref","unstructured":"Ioannidis, Y.E., Poosala, V.: Balancing histogram optimality and practicality for query result size estimation. In: Carey, M.J., Schneider, D.A. (eds.) Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, San Jose, 22\u201325 May 1995, pp. 233\u2013244. ACM Press, New York (1995)","DOI":"10.1145\/223784.223841"},{"key":"50_CR15","unstructured":"Jagadish, H.V., Koudas, N., Muthukrishnan, S., Poosala, V., Sevcik, K.C., Suel, T.: Optimal histograms with quality guarantees. In: Proceedings of the 24th International Conference on Very Large Data Bases, VLDB \u201998, pp. 275\u2013286. Morgan Kaufmann Publishers Inc., San Francisco (1998). http:\/\/dl.acm.org\/citation.cfm?id=645924.671191"},{"key":"50_CR16","doi-asserted-by":"crossref","unstructured":"Karras, P., Mamoulis, N.: Hierarchical synopses with optimal error guarantees. ACM Trans. Database Syst. 33, 1\u201353 (2008). doi: 10.1145\/1386118.1386124","DOI":"10.1145\/1386118.1386124"},{"key":"50_CR17","unstructured":"Lin, M.Y., Hsueh, S.C., Hwang, S.K.: Interactive mining of frequent itemsets over arbitrary time intervals in a data stream. In: Proceedings of the 19th Conference on Australasian Database, vol. 75, ADC \u201908, pp. 15\u201321. Australian Computer Society Inc., Darlinghurst (2007). http:\/\/dl.acm.org\/citation.cfm?id=1378307.1378315"},{"key":"50_CR18","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0167-6423(82)90012-0","volume":"2","author":"J Misra","year":"1982","unstructured":"Misra, J., Gries, D.: Finding repeated elements. Sci. Comput. Program. 2, 143\u2013152 (1982). doi: 10.1016\/0167-6423(82)90012-0","journal-title":"Sci. Comput. Program."},{"key":"50_CR19","doi-asserted-by":"crossref","unstructured":"Poosala, V., Ioannidis, Y.E., Haas, P.J., Shekita, E.J.: Improved histograms for selectivity estimation of range predicates. In: SIGMOD Conference, pp. 294\u2013305 (1996)","DOI":"10.1145\/235968.233342"},{"key":"50_CR20","unstructured":"Rodrigues, P., Gama, J., Sebastipo, R.: Memoryless fading windows in ubiquitous settings. In: Proceedings of Ubiquitous Data Mining (UDM) Workshop, in conjunction with the 19th European Conference on Artificial Intelligence, ECAI 2010, pp. 27\u201332 (2010)"},{"key":"50_CR21","doi-asserted-by":"crossref","unstructured":"Scott, D.W.: On optimal and data-based histograms. Biometrika 66(3), 605\u2013610 (1979). doi: 10.1093\/biomet\/66.3.605","DOI":"10.1093\/biomet\/66.3.605"},{"key":"50_CR22","doi-asserted-by":"crossref","unstructured":"Street, W.N., Kim, Y.: A streaming ensemble algorithm (sea) for large-scale classification. In: Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 377\u2013382. ACM Press, New York (2001)","DOI":"10.1145\/502512.502568"},{"key":"50_CR23","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1080\/01621459.1926.10502161","volume":"21","author":"HA Sturges","year":"1926","unstructured":"Sturges, H.A.: The choice of a class interval. Am. Stat. Assoc. 21, 65\u201366 (1926)","journal-title":"Am. Stat. Assoc."},{"key":"50_CR24","doi-asserted-by":"crossref","unstructured":"Vitter, J.S.: Random sampling with a reservoir. ACM Trans. Math. Softw. 11(1), 37\u201357 (1985). doi: 10.1145\/3147.3165","DOI":"10.1145\/3147.3165"}],"container-title":["Progress in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13748-014-0050-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13748-014-0050-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13748-014-0050-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T07:42:41Z","timestamp":1565336561000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13748-014-0050-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,11]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["50"],"URL":"https:\/\/doi.org\/10.1007\/s13748-014-0050-9","relation":{},"ISSN":["2192-6352","2192-6360"],"issn-type":[{"value":"2192-6352","type":"print"},{"value":"2192-6360","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,11]]}}}