{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:32:38Z","timestamp":1725492758225},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440376"},{"type":"electronic","value":"9783540456810"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45681-3_18","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T11:03:25Z","timestamp":1192791805000},"page":"212-224","source":"Crossref","is-referenced-by-count":12,"title":["Support Approximations Using Bonferroni-Type Inequalities"],"prefix":"10.1007","author":[{"given":"Szymon","family":"Jaroszewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan A.","family":"Simovici","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,18]]},"reference":[{"key":"18_CR1","first-page":"307","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"R. Agrawal","year":"1996","unstructured":"R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. Inkeri Verkamo. Fast discovery of association rules. In U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, editors, Advances in Knowledge Discovery and Data Mining, pages 307\u2013328. AAAI Press, Menlo Park, 1996."},{"key":"18_CR2","unstructured":"L. Buzzigoli and A. Giusti. An algorithm to calculate the lower and upper bounds of the elements of an array given its marginals. In Statistical Data Protection (SDP\u201998), Eurostat, pages 131\u2013147, Luxembourg, 1999."},{"key":"18_CR3","unstructured":"C. L. Blake and C. J. Merz. UCI Repository of machine learning databases. University of California, Irvine, Dept. of Information and Computer Sciences, \n                    http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html\n                    \n                  , 1998."},{"key":"18_CR4","unstructured":"A. Dobra. Computing sharp integer bounds for entries in contingency tables given a set of fixed marginals. Technical report, Department of Statistics, Carnegie Mellon University, \n                    http:\/\/www.stat.cmu.edu\/~adobra\/bonf-two.pdf\n                    \n                  , 2001."},{"key":"18_CR5","unstructured":"J. Galambos and I. Simonelli. Bonferroni-type Inequalities with Applications. Springer, 1996."},{"key":"18_CR6","unstructured":"S. Jaroszewicz, D. Simovici, and I. Rosenberg. An inclusion-exclusion result for boolean polynomials and its applications in data mining. In Proceedings of the Discrete Mathematics in Data Mining Workshop, SIAM Datamining Conference, Washington, D.C., 2002."},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/BF01271266","volume":"16","author":"J. Kahn","year":"1996","unstructured":"J. Kahn, N. Linial, and A. Samorodnitsky. Inclusion-exclusion: Exact and approximate. Combinatorica, 16:465\u2013477, 1996.","journal-title":"Combinatorica"},{"key":"18_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/3-540-44794-6_42","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"H. Mannila","year":"2001","unstructured":"H. Mannila. Combining discrete algorithms and probabilistic approaches in data mining. In L. DeRaedt and A. Siebes, editors, Principles of Data Mining and Knowledge Discovery, volume 2168 of Lecture Notes in Artificial Intelligence, page 493. Springer-Verlag, Berlin, 2001."},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"H. Mannila. Global and local methods in data mining: basic techniques and open problems. In ICALP 2002, 29th International Colloquium on Automata, Languages, and Programming, Malaga, Spain, June 2002. Springer-Verlag.","DOI":"10.1007\/3-540-45465-9_6"},{"key":"18_CR10","unstructured":"H. Mannila and H. Toivonen. Multiple uses of frequent sets and condensed representations. In Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD\u201996), pages 189\u2013194, Portland, Oregon, 1996."},{"key":"18_CR11","unstructured":"D. Pavlov, H. Mannila, and P. Smyth. Probabilistic models for query approximation with large sparse binary data sets. In Proc. of Sixteenth Conference on Uncertainty in Artificial Intelligence (UAI-00), Stanford, 2000."},{"key":"18_CR12","volume-title":"Beyond independence: Probabilistic models for query approximation on binary transaction data","author":"D. Pavlov","year":"2001","unstructured":"D. Pavlov, H. Mannila, and P. Smyth. Beyond independence: Probabilistic models for query approximation on binary transaction data. ICS TR-01-09, University of California, Irvine, 2001."},{"key":"18_CR13","first-page":"393","volume":"37","author":"A. R\u00e9nyi","year":"1958","unstructured":"A. R\u00e9nyi. Quelques remarques ser les probabilites des evenements dependants. Journal de Mathematique, 37:393\u2013398, 1958.","journal-title":"Journal de Mathematique"}],"container-title":["Lecture Notes in Computer Science","Principles of Data Mining and Knowledge Discovery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45681-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T09:48:26Z","timestamp":1551001706000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45681-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440376","9783540456810"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45681-3_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}