{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T05:12:04Z","timestamp":1740287524158,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540200857"},{"type":"electronic","value":"9783540398042"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39804-2_9","type":"book-chapter","created":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T04:06:45Z","timestamp":1277698005000},"page":"71-82","source":"Crossref","is-referenced-by-count":32,"title":["Minimal k-Free Representations of Frequent Sets"],"prefix":"10.1007","author":[{"given":"Toon","family":"Calders","sequence":"first","affiliation":[]},{"given":"Bart","family":"Goethals","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_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, Washington, D.C, pp. 207\u2013216 (1993)","DOI":"10.1145\/170035.170072"},{"issue":"2","key":"9_CR2","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/380995.381017","volume":"2","author":"Y. Bastide","year":"2000","unstructured":"Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., Lakhal, L.: Mining frequent patterns with counting inference. SIGKDD Explorations\u00a02(2), 66\u201375 (2000)","journal-title":"SIGKDD Explorations"},{"key":"9_CR3","unstructured":"Blake, C.L., Merz, C.J.: UCI Repository of machine learning databases. University of California, Irvine, Dept. of Information and Computer Sciences (1998), http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/3-540-45571-X_9","volume-title":"Knowledge Discovery and Data Mining. Current Issues and New Applications","author":"J.-F. Boulicaut","year":"2000","unstructured":"Boulicaut, J.-F., Bykowski, A.: Frequent closures as a concise representation for binary data mining. In: Terano, T., Chen, A.L.P. (eds.) PAKDD 2000. LNCS, vol.\u00a01805, pp. 62\u201373. Springer, Heidelberg (2000)"},{"key":"9_CR5","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, D.A., Komorowski, J., \u017bytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol.\u00a01910, pp. 75\u201385. Springer, Heidelberg (2000)"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Bykowski, A., Rigotti, C.: A condensed representation to find frequent patterns. In: Proc. PODS (2001)","DOI":"10.1145\/375551.375604"},{"key":"9_CR7","unstructured":"Calders, T.: Axiomatization and Deduction Rules for the Frequency of Itemsets. PhD thesis, University of Antwerp, Belgium (May 2003), http:\/\/win-www.ruca.ua.ac.be\/u\/calders\/download\/thesis.pdf"},{"key":"9_CR8","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":"9_CR9","volume-title":"Bonferroni-type Inequalities with Applications","author":"J. Galambos","year":"1996","unstructured":"Galambos, J., Simonelli, I.: Bonferroni-type Inequalities with Applications. Springer, Heidelberg (1996)"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz, M.: Concise representation of frequent patterns based on disjunctionfree generators. In: Proc. ICDM, pp. 305\u2013312 (2001)","DOI":"10.1109\/ICDM.2001.989533"},{"key":"9_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/3-540-47887-6_15","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"M. Kryszkiewicz","year":"2002","unstructured":"Kryszkiewicz, M., Gajek, M.: Concise representation of frequent patterns based on generalized disjunction-free generators. In: Chen, M.-S., Yu, P.S., Liu, B. (eds.) PAKDD 2002. LNCS (LNAI), vol.\u00a02336, pp. 159\u2013171. Springer, Heidelberg (2002)"},{"key":"9_CR12","series-title":"Lecture Notes in Artificial Intelligence","first-page":"382","volume-title":"Foundations of Intelligent Systems","author":"M. Kryszkiewicz","year":"2002","unstructured":"Kryszkiewicz, M., Gajek, M.: Why to apply generalized disjunction-free generators representation of frequent patterns? In: Hacid, M.-S., Ra\u015b, Z.W., Zighed, D.A., Kodratoff, Y. (eds.) ISMIS 2002. LNCS (LNAI), vol.\u00a02366, pp. 382\u2013392. Springer, Heidelberg (2002)"},{"key":"9_CR13","unstructured":"Mannila, H., Toivonen, H.: Multiple uses of frequent sets and condensed representations. In: Proc. KDD (1996)"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/3-540-49257-7_25","volume-title":"Database Theory - ICDT\u201999","author":"N. Pasquier","year":"1998","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, pp. 398\u2013416. Springer, Heidelberg (1998)"},{"key":"9_CR15","unstructured":"Pei, J., Han, J., Mao, R.: Closet: An efficient algorithm for mining frequent closed itemsets. In: ACM SIGMOD Workshop DMKD, Dallas, TX (2000)"},{"key":"9_CR16","unstructured":"Zaki, M.J., Hsiao, C.: ChARM: An efficient algorithm for closed association rule mining. TR 99-10, Computer Science, Rensselaer Polytechnic Institute (1999)"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Zheng, Z., Kohavi, R., Mason, L.: Real world performance of association rule algorithms. In: Proc. KDD, pp. 401\u2013406 (2001)","DOI":"10.1145\/502512.502572"}],"container-title":["Lecture Notes in Computer Science","Knowledge Discovery in Databases: PKDD 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39804-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T08:34:35Z","timestamp":1740213275000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39804-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540200857","9783540398042"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39804-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}