{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:58:56Z","timestamp":1743134336523,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540224792"},{"type":"electronic","value":"9783540444978"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"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":[[2004]]},"DOI":"10.1007\/978-3-540-44497-8_12","type":"book-chapter","created":{"date-parts":[[2010,2,25]],"date-time":"2010-02-25T20:08:07Z","timestamp":1267128487000},"page":"234-249","source":"Crossref","is-referenced-by-count":6,"title":["Model-Independent Bounding of the Supports of Boolean Formulae in Binary Data"],"prefix":"10.1007","author":[{"given":"Artur","family":"Bykowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jouni K.","family":"Sepp\u00e4nen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaakko","family":"Hollm\u00e9n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","first-page":"307","volume-title":"Advances in Knowledge Discovery and Data Mining, ch.\u00a012","author":"R. Agrawal","year":"1996","unstructured":"Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast discovery of association rules. In: Fayyad, U.M., Piatetsky-Shapiro, G., Smyth, P., Uthurusamy, R. (eds.) Advances in Knowledge Discovery and Data Mining, ch.\u00a012, pp. 307\u2013328. AAAI Press, Menlo Park (1996)"},{"key":"12_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/3-540-45372-5_8","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"J.-F. Boulicaut","year":"2000","unstructured":"Boulicaut, J.-F., Bykowski, A., Rigotti, C.: Approximation of frequency queries by means of free-sets. In: Zighed, A.D.A., Komorowski, J., \u017bytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol.\u00a01910, pp. 75\u201385. Springer, Heidelberg (2000)"},{"key":"12_CR3","volume-title":"Proc. of the 20th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS 2001)","author":"A. Bykowski","year":"2001","unstructured":"Bykowski, A., Rigotti, C.: A condensed representation to find frequent patterns. In: Proc. of the 20th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS 2001), Santa Barbara, CA, USA, May 2001, ACM, New York (2001)"},{"key":"12_CR4","unstructured":"Calders, T.: Deducing bounds on the frequency of itemsets. In: EDBT 2002 Workshop on Database Technologies for Data Mining (2002)"},{"key":"12_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/3-540-45681-3_7","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"T. Calders","year":"2002","unstructured":"Calders, T., Goethals, B.: Mining all non-derivable frequent itemsets. In: Elomaa, T., Mannila, H., Toivonen, H. (eds.) PKDD 2002. LNCS (LNAI), vol.\u00a02431, pp. 74\u201385. Springer, Heidelberg (2002)"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Gouda, K., Zaki, M.J.: Efficiently mining maximal frequent itemsets. In: Proc. of the 2001 IEEE International Conference on Data Mining (ICDM 2001), San Jose, California, USA, pp. 163\u2013170 (2001)","DOI":"10.1109\/ICDM.2001.989514"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/342009.335372","volume-title":"2000 ACM SIGMOD Intl. Conference on Management of Data","author":"J. Han","year":"2000","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Chen, W., Naughton, J., Bernstein, P.A. (eds.) 2000 ACM SIGMOD Intl. Conference on Management of Data, May 2000, pp. 1\u201312. ACM Press, New York (2000)"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Karmarkar, N.: A new polynomial-time algorithm for linear programming. In: Proceedings of the sixteenth annual ACM symposium on Theory of computing, pp. 302\u2013311 (1984)","DOI":"10.1145\/800057.808695"},{"key":"12_CR9","volume-title":"Advanced Engineering Mathematics","author":"E. Kreyszig","year":"1993","unstructured":"Kreyszig, E.: Advanced Engineering Mathematics, 7th edn. John Wiley Inc., Chichester (1993)","edition":"7"},{"key":"12_CR10","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1613\/jair.453","volume":"8","author":"A. Moore","year":"1998","unstructured":"Moore, A., Lee, M.S.: Cached sufficient statistics for efficient machine learning with large datasets. Journal of Artificial Intelligence Research\u00a08, 67\u201391 (1998)","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"4\/5","key":"12_CR11","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/BF01940877","volume":"16","author":"J. Matou\u0161ek","year":"1996","unstructured":"Matou\u0161ek, J., Sharir, M., Welzl, E.: A subexponential bound for linear programming. Algorithmica\u00a016(4\/5), 498\u2013516 (1996)","journal-title":"Algorithmica"},{"key":"12_CR12","first-page":"189","volume-title":"Proc. of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD 1996)","author":"H. Mannila","year":"1996","unstructured":"Mannila, H., Toivonen, H.: Multiple uses of frequent sets and condensed representations: Extended abstract. In: Proc. of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD 1996), Portland, Oregon, USA, August 1996, pp. 189\u2013194. AAAI Press, Menlo Park (1996)"},{"issue":"3","key":"12_CR13","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1023\/A:1009748302351","volume":"1","author":"H. Mannila","year":"1997","unstructured":"Mannila, H., Toivonen, H., Verkamo, A.I.: Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery\u00a01(3), 259\u2013289 (1997)","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"1","key":"12_CR14","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0306-4379(99)00003-4","volume":"24","author":"N. Pasquier","year":"1999","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Efficient mining of association rules using closed itemset lattices. Information Systems\u00a024(1), 25\u201346 (1999)","journal-title":"Information Systems"},{"key":"12_CR15","unstructured":"Pavlov, D., Mannila, H., Smyth, P.: Probabilistic models for query approximation with large sparse binary datasets. In: Proc. of the 16th Conference in Uncertainty in Artificial Intelligence (UAI 2000), Stanford, California, USA (2000)"},{"key":"12_CR16","unstructured":"Toivonen, H.: Sampling large databases for association rules. In: Proc. of the 22th International Conference on Very Large Data Bases (VLDB 1996), Mumbai (Bombay), India, pp. 134\u2013145 (1996)"},{"issue":"2","key":"12_CR17","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1023\/A:1009783824328","volume":"1","author":"T. Zhang","year":"1997","unstructured":"Zhang, T., Ramakrishnan, R., Livny, M.: BIRCH: A new data clustering algorithm and its applications. Data Mining and Knowledge Discovery\u00a01(2), 141\u2013182 (1997)","journal-title":"Data Mining and Knowledge Discovery"}],"container-title":["Lecture Notes in Computer Science","Database Support for Data Mining Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-44497-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T22:00:38Z","timestamp":1739916038000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-44497-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540224792","9783540444978"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-44497-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}