{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T16:46:09Z","timestamp":1749573969399},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540673828"},{"type":"electronic","value":"9783540455714"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45571-x_9","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T12:37:57Z","timestamp":1184589477000},"page":"62-73","source":"Crossref","is-referenced-by-count":35,"title":["Frequent Closures as a Concise Representation for Binary Data Mining"],"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"}]}],"member":"297","published-online":{"date-parts":[[2003,3,24]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In: Proc. SIGMOD\u201993, Washington DC (USA), pages 207\u2013216, May 1993, ACM Press.","DOI":"10.1145\/170035.170072"},{"key":"9_CR2","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, 1996, AAAI Press."},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"R.J. Bayardo. Efficiently mining of long patterns from databases. In: Proc. SIG-MOD\u201998, Seattle (USA), pages 85\u201393, June 1998, ACM Press.","DOI":"10.1145\/276304.276313"},{"key":"9_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/3-540-48298-9_31","volume-title":"Proc. DaWak\u201999","author":"J.-F. Boulicaut","year":"1999","unstructured":"J-F. Boulicaut, M. Klemettinen, and H. Mannila. Modeling KDD processes within the Inductive Database Framework. In: Proc. DaWak\u201999, Florence (I), pages 293\u2013302, September 1999, Springer-Verlag, LNCS 1676."},{"key":"9_CR5","unstructured":"J-F. Boulicaut, A. Bykowski, and C. Rigotti. Mining almost-closures in highly correlated data. Research Report LISI INSA Lyon, 2000, 20 pages."},{"key":"9_CR6","unstructured":"A. Bykowski. Frequent set discovery in highly correlated data. Master of Science thesis, INSA Lyon, July 1999, 30 pages."},{"key":"9_CR7","unstructured":"H. Toivonen. Sampling large databases for association rules. In: Proc. VLDB\u201996, Mumbay (India), pages 134\u2013145, September 1996, Morgan Kaufmann."},{"key":"9_CR8","unstructured":"H. Mannila and H. Toivonen. Multiple uses of frequent sets and condensed representations. In: Proc. KDD\u201996, Portland (USA), pages 189\u2013194, August 1996, AAAI Press."},{"key":"9_CR9","first-page":"21","volume-title":"Proc. ILPS\u201997","author":"H. Mannila","year":"1997","unstructured":"H. Mannila. Inductive databases and condensed representations for data mining. In: Proc. ILPS\u201997, Port Jefferson, Long Island N.Y. (USA), pages 21\u201330, October 1997, MIT Press."},{"issue":"1","key":"9_CR10","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, Volume 24(1), pages 25\u201346, 1999.","journal-title":"Information Systems"},{"key":"9_CR11","unstructured":"N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Closed set discovery of small covers for association rules. In: Proc. BDA\u201999, Bordeaux (F), pages 53\u201368, October 1999."},{"key":"9_CR12","unstructured":"M. Zaki and M. Ogihara. Theoretical foundations of association rules. In: Proc. Workshop post-SIGMOD DMKD\u201998, Seattle (USA), pages 85\u201393, June 1998."},{"issue":"3","key":"9_CR13","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"}],"container-title":["Lecture Notes in Computer Science","Knowledge Discovery and Data Mining. Current Issues and New Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45571-X_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T20:27:46Z","timestamp":1550435266000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45571-X_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540673828","9783540455714"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45571-x_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}