{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T20:41:55Z","timestamp":1778272915258,"version":"3.51.4"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data Mining and Knowledge Discovery"],"published-print":{"date-parts":[[2003,1]]},"DOI":"10.1023\/a:1021571501451","type":"journal-article","created":{"date-parts":[[2003,3,20]],"date-time":"2003-03-20T20:44:11Z","timestamp":1048193051000},"page":"5-22","source":"Crossref","is-referenced-by-count":176,"title":["Free-Sets: A Condensed Representation of Boolean Data for the Approximation of Frequency Queries"],"prefix":"10.1007","volume":"7","author":[{"given":"Jean-Fran\u00e7ois","family":"Boulicaut","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Artur","family":"Bykowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christophe","family":"Rigotti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5107138_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., and Swami, A. 1993. Mining association rules between sets of items in large databases. In Proc. of the 1993 ACM SIGMOD International Conference on Management of Data(SIGMOD'93), Washington, D.C., pp.207\u2013216.","DOI":"10.1145\/170035.170072"},{"key":"5107138_CR2","unstructured":"Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., and Verkamo, A.I. 1996. Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining, AAAI Press, pp. 307\u2013328."},{"key":"5107138_CR3","unstructured":"Agrawal, R. and Srikant, R. 1994. Fast algorithms for mining association rules in large databases. In Proc. of the 20th International Conference on Very Large Data Bases (VLDB'94), Santiago de Chile, Chile, pp. 487\u2013499."},{"key":"5107138_CR4","unstructured":"Bayardo, R.J. 1997. Brute-force mining of high-confidence classification rules. In Proc. of the Third International Conference on Knowledge Discovery and Data Mining (KDD'97), Newport Beach, California, pp.123\u2013126."},{"key":"5107138_CR5","doi-asserted-by":"crossref","unstructured":"Bayardo, R.J. 1998. Efficiently mining long patterns from databases. In Proc. of the 1998 ACM SIGMOD International Conference on Management of Data (SIGMOD'98), Seattle, Washington, pp. 85\u201393.","DOI":"10.1145\/276304.276313"},{"key":"5107138_CR6","first-page":"62","volume-title":"Proc. of the Fourth Pacific-Asia Conference on Knowledge Discovery and Data Mining","author":"J.-F. Boulicaut","year":"2000","unstructured":"Boulicaut, J.-F. and Bykowski, A. 2000. Frequent closures as a concise representation for binary data mining. In Proc. of the Fourth Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD'00), Vol. 1805 of LNAI, Kyoto, JP, Berlin: Springer-Verlag, pp. 62\u201373."},{"key":"5107138_CR7","unstructured":"Boulicaut, J.-F., Bykowski, A., and Rigotti, C. to appear. Approximation of frequency queries by mean of freesets. In Proc. of the 4th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD'00), LNAI, Lyon, France, Berlin: Springer-Verlag."},{"key":"5107138_CR8","unstructured":"Bykowski, A. and Gomez-Chantada, L. 2000. Frequent item set extraction in highly-correlated data: A web usage mining application. In Proc. of the 2000 International Workshop on Web Knowledge Discovery and Data Mining (WKDDM'00), Kyoto, Japan, pp. 27\u201342."},{"key":"5107138_CR9","doi-asserted-by":"crossref","unstructured":"Fujiwara, S., Ullman, J.D., and Motwani, R. 2000. Dynamic miss-counting algorithms: Finding implication and similarity rules with confidence pruning. In Proc. of the 16th International Conference on Data Engineering (ICDE'00), San Diego, California, pp. 501\u2013511.","DOI":"10.1109\/ICDE.2000.839449"},{"key":"5107138_CR10","unstructured":"Mannila, H. and Toivonen, H. 1996.Multiple uses of frequent sets and condensed representations. In Proc. of the Second International Conference on Knowledge Discovery and Data Mining (KDD'96), Portland, Oregon, pp. 189\u2013194."},{"issue":"3","key":"5107138_CR11","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1023\/A:1009796218281","volume":"1","author":"H. Mannila","year":"1997","unstructured":"Mannila, H. and Toivonen, H. 1997. Level wise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery, 1(3):241\u2013258.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"5107138_CR12","doi-asserted-by":"crossref","unstructured":"Ng, R., Lakshmanan, L.V., Han, J., and Pang, A. 1998. Exploratory mining and pruning optimization of constrained association rules. In Proc. of the 1998 ACM SIGMOD International Conference on Management of Data (SIGMOD'98), Seattle, Washington, pp. 13\u201324.","DOI":"10.1145\/276304.276307"},{"issue":"1","key":"5107138_CR13","doi-asserted-by":"crossref","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., and Lakhal, L. 1999. Efficient mining of association rules using closed item set lattices. Information Systems, 24(1):25\u201346.","journal-title":"Information Systems"},{"key":"5107138_CR14","unstructured":"Pavlov, D., Mannila, H., and Smyth, P. 2000. Probalistic models for query approximation with large data sets. Technical Report 2000-07, Department of Information and Computer Science, Univsersity of California, Irvine, CA-92697-3425."},{"key":"5107138_CR15","first-page":"229","volume-title":"In Knowledge Discovery in Databases","author":"G. Piatetsky-Shapiro","year":"1991","unstructured":"Piatetsky-Shapiro, G. 1991. Discovery, analysis, and presentation of strong rules. In Knowledge Discovery in Databases, Menlo Park, CA: AAAI Press, pp. 229\u2013248."},{"key":"5107138_CR16","unstructured":"Jean-Fran\u00e7ois Boulicaut is currently an associate professor at INSA Lyon (Ph.D. in 1992, Habilitation in 2001). His main research interests are databases and knowledge discovery from databases. He is the leader of the \u201cData Mining group\u201d at INSA Lyon and coordinates the cInQ IST-2000-26469 project (consortium on knowledge discovery with Inductive Queries, 2001\u20132004) funded by the European Union."},{"key":"5107138_CR17","unstructured":"Artur Bykowski earned his Ph.D. in Computer Science from INSA Lyon in 2002. His Ph.D. thesis was entitled \u201cCondensed representations of frequent sets: application to descriptive pattern discovery\u201d. His research interests include condensed representations of frequent patterns and rule mining from large databases."},{"key":"5107138_CR18","unstructured":"Christophe Rigotti received his Ph.D. in Computer Science from INSA Lyon in 1996. His research interests include data mining, constraint programming, inductive programming and databases. He is currently an assistant professor at INSA Lyon and a visiting member of the Ludwig Maximilians University of Munich."}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021571501451.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1021571501451\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021571501451.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T03:10:56Z","timestamp":1752462656000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1021571501451"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["5107138"],"URL":"https:\/\/doi.org\/10.1023\/a:1021571501451","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}