{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:12:29Z","timestamp":1725549149309},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540250821"},{"type":"electronic","value":"9783540318415"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31841-5_4","type":"book-chapter","created":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T11:01:31Z","timestamp":1267441291000},"page":"46-65","source":"Crossref","is-referenced-by-count":1,"title":["Theoretical Bounds on the Size of Condensed Representations"],"prefix":"10.1007","author":[{"given":"Nele","family":"Dexters","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toon","family":"Calders","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imilienski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proc. ACM SIGMOD Int. Conf. Management of Data, Washington, D.C., pp. 207\u2013216 (1993)","DOI":"10.1145\/170035.170072"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Srikant, R.: Privacy-preserving data mining. In: Proc. ACM SIGMOD Int. Conf. Management of Data, pp. 439\u2013450 (2000)","DOI":"10.1145\/342009.335438"},{"key":"4_CR3","unstructured":"Blake, C.L., Merz, C.J.: The UCI Repository of machine learning databases. University of California, Department of Information and Computer Science, Irvine (1998), http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Boulicaut, J.-F., Bykowski, A., Rigotti, C.: Approximation of frequency queries by means of free-sets. In: Proc. PKDD Int. Conf. Principles of Data Mining and Knowledge Discovery, pp. 75\u201385 (2000)","DOI":"10.1007\/3-540-45372-5_8"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Bykowski, A., Rigotti, C.: A condensed representation to find frequent patterns. In: Proc. PODS Int. Conf. Principles of Database Systems (2001)","DOI":"10.1145\/375551.375604"},{"key":"4_CR6","unstructured":"Calders, T.: Deducing bounds on the frequency of itemsets. In: EDBT Workshop DTDM Database Techniques in Data Mining (2002)"},{"key":"4_CR7","unstructured":"Calders, T.: Axiomatization and Deduction Rules for the Frequency of Itemsets. PhD thesis, University of Antwerp, Belgium (2003), http:\/\/win-www.ruca.ua.ac.be\/u\/calders\/download\/thesis.pdf"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Calders, T., Goethals, B.: Minimal k-free representations of frequent sets. In: Proc. PKDD Int. Conf. Principles of Data Mining and Knowledge Discovery, pp. 71\u201382 (2002)","DOI":"10.1007\/978-3-540-39804-2_9"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/3-540-45681-3_7","volume-title":"Proc. PKDD Int. Conf. Principles of Data Mining and Knowledge Discovery","author":"T. Calders","year":"2002","unstructured":"Calders, T., Goethals, B.: Mining all non-derivable frequent itemsets. In: Proc. PKDD Int. Conf. Principles of Data Mining and Knowledge Discovery, pp. 74\u201385. Springer, Heidelberg (2002)"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Evfimievski, A., Srikant, R., Agrawal, R., Gehrke, J.: Privacy preserving mining of association rules. In: Proc. KDD Int. Conf. Knowledge Discovery in Databases (2002)","DOI":"10.1145\/775047.775080"},{"key":"4_CR11","unstructured":"Hettich, S., Bay, S.D.: The UCI KDD Archive. University of California, Department of Information and Computer Science, Irvine (1999), http:\/\/kdd.ics.uci.edu"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz, M.: Concise representation of frequent patterns based on disjunction-free generators. In: Proc. IEEE Int. Conf. on Data Mining, pp. 305\u2013312 (2001)","DOI":"10.1109\/ICDM.2001.989533"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz, M.: Upper bound on the length of generalized disjunction free patterns. In: SSDBM (2004)","DOI":"10.1109\/SSDM.2004.1311191"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz, M., Gajek, M.: Concise representation of frequent patterns based on generalized disjunction-free generators. In: Proc. PaKDD Pacific-Asia Conf. on Knowledge Discovery and Data Mining, pp. 159\u2013171 (2002)","DOI":"10.1007\/3-540-47887-6_15"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz, M., Gajek, M.: Why to apply generalized disjunction-free generators representation of frequent patterns? In: Proc. International Syposium on Methodologies for Intelligent Systems, pp. 382\u2013392 (2002)","DOI":"10.1007\/3-540-48050-1_42"},{"key":"4_CR16","unstructured":"Mannila, H., Toivonen, H.: Multiple uses of frequent sets and condensed representations. In: Proc. KDD Int. Conf. Knowledge Discovery in Databases (1996)"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Proc. ICDT Int. Conf. Database Theory, pp. 398\u2013416 (1999)","DOI":"10.1007\/3-540-49257-7_25"},{"key":"4_CR18","unstructured":"Van den Bussche, J., Geerts, F., Goethals, B.: A tight upper bound on the number of candidate patterns. In: Proc. ICDM, pp. 155\u2013162 (2001)"}],"container-title":["Lecture Notes in Computer Science","Knowledge Discovery in Inductive Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31841-5_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:28:00Z","timestamp":1605742080000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31841-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540250821","9783540318415"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31841-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}