{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:19:37Z","timestamp":1740097177966,"version":"3.37.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319213972"},{"type":"electronic","value":"9783319213989"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21398-9_57","type":"book-chapter","created":{"date-parts":[[2015,6,23]],"date-time":"2015-06-23T11:12:41Z","timestamp":1435057961000},"page":"731-743","source":"Crossref","is-referenced-by-count":2,"title":["Evaluating Bayesian Networks via Data Streams"],"prefix":"10.1007","author":[{"given":"Andrew","family":"McGregor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hoa T.","family":"Vu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,24]]},"reference":[{"key":"57_CR1","unstructured":"Braverman, V., Chung, K.M., Liu, Z., Mitzenmacher, M., Ostrovsky, R.: Ams without 4-wise independence on product domains. In: STACS, pp. 119\u2013130 (2010)"},{"key":"57_CR2","doi-asserted-by":"crossref","unstructured":"Braverman, V., Ostrovsky, R.: Measuring independence of datasets. In: STOC, pp. 271\u2013280 (2010)","DOI":"10.1145\/1806689.1806728"},{"key":"57_CR3","doi-asserted-by":"crossref","unstructured":"Chakrabarti, A., Cormode, G., McGregor, A.: A near-optimal algorithm for estimating the entropy of a stream. ACM Transactions on Algorithms 6(3) (2010)","DOI":"10.1145\/1798596.1798604"},{"key":"57_CR4","doi-asserted-by":"crossref","unstructured":"Chow, C., Liu, C.: Approximating discrete probability distributions with dependence trees. IEEE Trans. Inf. Theor. 14(3), 462\u2013467 (2006). \n                      http:\/\/dx.doi.org\/10.1109\/TIT.1968.1054142","DOI":"10.1109\/TIT.1968.1054142"},{"issue":"1","key":"57_CR5","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.jalgor.2003.12.001","volume":"55","author":"G Cormode","year":"2005","unstructured":"Cormode, G., Muthukrishnan, S.: An improved data stream summary: the count-min sketch and its applications. Journal of Algorithms 55(1), 58\u201375 (2005)","journal-title":"Journal of Algorithms"},{"key":"57_CR6","unstructured":"Indyk, P., McGregor, A.: Declaring independence via the sketching of sketches. In: SODA, pp. 737\u2013745 (2008)"},{"key":"57_CR7","doi-asserted-by":"crossref","unstructured":"Jensen, F.V., Nielsen, T.D.: Bayesian networks and decision graphs. Springer (2007)","DOI":"10.1007\/978-0-387-68282-2"},{"key":"57_CR8","doi-asserted-by":"crossref","unstructured":"Jordan, M.I., Ghahramani, Z., Jaakkola, T.S., Saul, L.K.: An introduction to variational methods for graphical models. Springer (1998)","DOI":"10.1007\/978-94-011-5014-9_5"},{"issue":"4","key":"57_CR9","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1137\/0405044","volume":"5","author":"B Kalyanasundaram","year":"1992","unstructured":"Kalyanasundaram, B., Schintger, G.: The probabilistic communication complexity of set intersection. SIAM Journal on Discrete Mathematics 5(4), 545\u2013557 (1992)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"57_CR10","doi-asserted-by":"crossref","unstructured":"Kane, D.M., Nelson, J., Porat, E., Woodruff, D.P.: Fast moment estimation in data streams in optimal space. In: STOC, pp. 745\u2013754 (2011)","DOI":"10.1145\/1993636.1993735"},{"key":"57_CR11","doi-asserted-by":"crossref","unstructured":"Pappas, A., Gillies, D.F.: A New Measure for the Accuracy of a Bayesian Network. In: Coello Coello, C.A., de Albornoz, \u00c1., Sucar, L.E., Battistutti, O.C. (eds.) MICAI 2002. LNCS (LNAI), vol. 2313, pp. 411\u2013419. Springer, Heidelberg (2002)","DOI":"10.1007\/3-540-46016-0_43"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21398-9_57","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T04:32:12Z","timestamp":1559190732000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-21398-9_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319213972","9783319213989"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21398-9_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}