{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T16:46:10Z","timestamp":1749573970407},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540410669"},{"type":"electronic","value":"9783540453727"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45372-5_8","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T07:21:49Z","timestamp":1186903309000},"page":"75-85","source":"Crossref","is-referenced-by-count":62,"title":["Approximation of Frequency Queries by Means of Free-Sets"],"prefix":"10.1007","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","published-online":{"date-parts":[[2002,7,18]]},"reference":[{"key":"8_CR1","unstructured":"R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. I. Verkamo. Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining, pages 307\u2013328. AAAI Press, 1996."},{"key":"8_CR2","unstructured":"R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In Proc. VLDB\u201994, pages 487\u2013499, 1994."},{"key":"8_CR3","unstructured":"R. J. Bayardo. Brute-force mining of high-confidence classification rules. In Proceedings KDD\u201997, pages 123\u2013126, 1997."},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"R. J. Bayardo. Efficiently mining long patterns from databases. In Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, pages 85\u201393. ACM Press, 1998.","DOI":"10.1145\/276304.276313"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"J.-F. Boulicaut and A. Bykowski. Frequent closures as a concise representation for binary data mining. In Proc. PAKDD\u201900, volume 1805 of LNAI, pages 62\u201373, Kyoto, JP, 2000. Springer-Verlag.","DOI":"10.1007\/3-540-45571-X_9"},{"key":"8_CR6","unstructured":"J.-F. Boulicaut and B. Jeudy. Using constraints during itemset mining: a generic approach. Technical Report 2000\u201301, INSA Lyon, LISI, F-69621 Villeurbanne, Mar. 2000."},{"key":"8_CR7","unstructured":"A. Bykowski. Frequent set discovery in highly-correlated data. Technical Report July 1999, Master of Science thesis, INSA Lyon, LISI, F-69621 Villeurbanne, 1999."},{"key":"8_CR8","unstructured":"A. Bykowski and L. Gomez-Chantada. Frequent itemset extraction in highly-correlated data: a web usage mining application. In Proc. WKDDM\u201900, pages 27\u201342, Kyoto, JP, Apr. 2000."},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"S. Fujiwara, J. D. Ullman, and R. Motwani. Dynamic miss-counting algorithms: Finding implication and similarity rules with confidence pruning. In Proc. ICDE\u201900, pages 501\u2013511, San Diego, USA, 2000.","DOI":"10.1109\/ICDE.2000.839449"},{"key":"8_CR10","unstructured":"H. Mannila and H. Toivonen. Multiple uses of frequent sets and condensed representations. In Proceedings KDD\u201996, pages 189\u2013194, Portland, USA, 1996."},{"issue":"3","key":"8_CR11","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1009796218281","volume":"1","author":"H. Mannila","year":"1997","unstructured":"H. Mannila and H. Toivonen. Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery, 1(3):241\u2013258, 1997.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"R. Ng, L. V. Lakshmanan, J. Han, and A. Pang. Exploratory mining and pruning optimization of constrained association rules. In Proc. ACM SIGMOD\u201998, pages 13\u201324, Seattle, USA, 1998.","DOI":"10.1145\/276304.276307"},{"issue":"1","key":"8_CR13","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0306-4379(99)00003-4","volume":"24","author":"N. Pasquier","year":"1999","unstructured":"N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Efficient mining of association rules using closed itemset lattices. Information Systems, 24(1):25\u201346, 1999.","journal-title":"Information Systems"},{"key":"8_CR14","unstructured":"D. Pavlov, H. Mannila, and P. Smyth. Probalistic models for query approximation with large data sets. Technical Report pp2000\u201307, Univsersity of California, Department of Information and Computer Science, Irvine, CA-92697-3425, Feb. 2000."},{"key":"8_CR15","first-page":"229","volume-title":"Knowledge Discovery in Databases","author":"G. Piatetsky-Shapiro","year":"1991","unstructured":"G. Piatetsky-Shapiro. Discovery, analysis, and presentation of strong rules. In Knowledge Discovery in Databases, pages 229\u2013248. AAAI Press, Menlo Park, CA, 1991."}],"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-45372-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T14:01:47Z","timestamp":1550757707000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45372-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540410669","9783540453727"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45372-5_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}